WO2007136371A1 - Procédé et système de gravure de disque au pointillé - Google Patents

Procédé et système de gravure de disque au pointillé Download PDF

Info

Publication number
WO2007136371A1
WO2007136371A1 PCT/US2006/019567 US2006019567W WO2007136371A1 WO 2007136371 A1 WO2007136371 A1 WO 2007136371A1 US 2006019567 W US2006019567 W US 2006019567W WO 2007136371 A1 WO2007136371 A1 WO 2007136371A1
Authority
WO
WIPO (PCT)
Prior art keywords
stipple
stroke
disk
strokes
size
Prior art date
Application number
PCT/US2006/019567
Other languages
English (en)
Inventor
Jr. William Havinden Bridge
Original Assignee
Oracle International Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Oracle International Corporation filed Critical Oracle International Corporation
Priority to PCT/US2006/019567 priority Critical patent/WO2007136371A1/fr
Publication of WO2007136371A1 publication Critical patent/WO2007136371A1/fr

Links

Classifications

    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/12—Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B20/1217—Formatting, e.g. arrangement of data block or words on the record carriers on discs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0613—Improving I/O performance in relation to throughput
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0644—Management of space entities, e.g. partitions, extents, pools
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0674—Disk device
    • G06F3/0676—Magnetic disk device
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/12—Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B20/1217—Formatting, e.g. arrangement of data block or words on the record carriers on discs
    • G11B2020/1218—Formatting, e.g. arrangement of data block or words on the record carriers on discs wherein the formatting concerns a specific area of the disc
    • G11B2020/1221—Formatting, e.g. arrangement of data block or words on the record carriers on discs wherein the formatting concerns a specific area of the disc cluster, i.e. a data structure which consists of a fixed number of sectors or ECC blocks
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/12—Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B2020/1291—Formatting, e.g. arrangement of data block or words on the record carriers wherein the formatting serves a specific purpose
    • G11B2020/1294—Increase of the access speed
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B2220/00—Record carriers by type
    • G11B2220/20—Disc-shaped record carriers
    • G11B2220/25—Disc-shaped record carriers characterised in that the disc is based on a specific recording technology
    • G11B2220/2508—Magnetic discs
    • G11B2220/2516—Hard disks

Definitions

  • This specification is directed to computer systems and more specifically to disk space partitioning.
  • a file system will usually consume the lower disk addresses first leaving the free space at higher addresses. This works well if the file system is using the whole physical disk. However if there are several partitions on a physical disk assigned to different hosts, then the allocated locations are separated by gaps of unused space. This results in larger seeks as the i/o is serviced for the different partitions.
  • Embodiments herein describe stippling, a method of dividing disk space that manages disk space and performance.
  • stippling may include setting
  • stippling may include dividing a disk into equal portion spaces, grouping the equal portion spaces into equal size sets, and allocating a portion of each set to each of a plurality of stipples.
  • a method of managing disk performance may include interleaving stipples.
  • FIG. IA illustrates process 125, one embodiment of a method of stippling a disk.
  • FIG. IB illustrates process 100, an embodiment of a method of stippling a disk.
  • FIG. 2A illustrates An Embodiment Of Process 250 Which Sets Stipple Parameters.
  • FIG. 2B illustrates example stipples of variable stroke sizes and stroke set sizes.
  • FIG. 3A illustrates example stipple bit masks and stipple member arrays.
  • FIG. 3B illustrates an embodiment of process 350 which configures stipples.
  • FIG. 4A is a physical representation of a stipple block being converted to a disk block.
  • FIG. 4B illustrates stipples with the corresponding stroke sets, stroke set members, and strokes.
  • FIG. 4C illustrates an embodiment of process 400 which converts a stipple block to a disk block.
  • Traditionally storage e.g., disk
  • Stippled storage is divided into a relatively small number of interleaved portions referred to herein as stipples.
  • Each stipple is made of a plurality of relatively small and interleaved portions spread across the storage or disk.
  • One embodiment of a method of stippling a disk is represented in process 125 of fig. Ia. This embodiment involves determining stipple parameters 110 such as stroke size and stroke set size, and configuring stipples 120 by choosing which stroke set members will belong to which stipples. In some embodiments a stipple mask is set for each stipple based on which stroke set members are included in each stipple. In another embodiment the stipple information, including stipple masks and parameters, is stored.
  • Stippling involves dividing up the disk into small equal size portions 102, grouping the portions into small equal size sets 104, and allocating a portion of each set to each stipple 106.
  • a stippled disk can be divided into a significant number of small equal size disk portions. These portions can be referred to as "strokes".
  • Process 250 shown in FIG. 2A further describes the sizing and grouping of strokes.
  • Process action 252 sets the stroke size. In some embodiments, an appropriate size for a stroke is as big as the largest I/O for the disk, but small enough so that there are a significant number (e.g., several thousand) on a disk. For contemporary storage systems an example stroke size is one megabyte.
  • Process action 254 divides the disks into strokes of the determined size. The strokes are grouped into equal fixed-size sets of contiguous strokes which can be referred to as "stroke sets". The stroke set size is determined in process action 256.
  • the size of the stroke set should be determined such that there is a relatively large number of stroke sets on a disk.
  • the strokes are grouped based on the determined stroke set size. The concatenation of all stroke sets can fill up the entire space, or disk, being stippled.
  • the stroke set size of a disk can be changed without remapping existing stipples. This is accomplished by multiplying the stroke set size by an integer and/or evenly dividing the stroke size by an integer.
  • the stipple member set can be changed to add more members to keep the mapping the same. For example, to increase an example stroke set size of 16, multiply by an integer value of 2 to get a stroke set size of 32. Note that the strokes within each stroke set have similar performance characteristics.
  • each stroke set is allocated to each stipple. Therefore, the size of a stroke set can have an effect on the granularity of the stipples. That is, the smaller the stroke set size, the fewer the number of potential stipples; the larger the stroke set size, the larger the number of potential stipples.
  • FIG. 2B shows an illustrative example of stipples of differing stroke sizes and stroke set sizes.
  • Disk 1 has 65536 blocks, is divided into 32 strokes of 2048 blocks (blocks can also be referred to as sectors) with each block being 512 bytes.
  • the stroke set size of example Disk 1 is 8.
  • Example Disk 1 has 4 stroke sets - stroke set 0, stroke set 1, stroke set 2, and stroke set 3, referenced by element numbers 212, 214, 216, and 218, respectively. Note that these examples are simplified to ease explanation and are not meant to limit scope in any way.
  • One or more strokes from each stroke set can be allocated to each stipple.
  • stipple 1 uses the first stroke of each stroke set as shown by the four diagonally striped strokes 210.
  • Stipple 2 uses the second and third stroke of each stroke set as shown by the eight vertically striped strokes 215. Notice that the allocating of strokes to stipples in this manner (i.e., interleaving) disperses each stipple throughout the entire stippled space and thus also disperses the disk performance among stipples.
  • Each stipple includes both high and low performing areas of the disk. Note that the strokes do not have to be allocated in order or all at once, that is, there can be unused strokes anywhere in the stroke set to reserve disk space and performance for future use.
  • a stipple can be de-allocated so that the strokes in the stroke set that were being used by the stipple can be reallocated to another stipple.
  • Disk 2 in FIG. 2B has 32768 blocks, a stroke size of 2048 blocks where the blocks are 512 bytes, a stroke set size of 4 strokes, and includes stroke sets 222, 224, 226, and 228.
  • Stipple 1 (220) uses the first stroke of each stroke set
  • stipple 2 225 uses the second stroke of each stroke set.
  • the potential number of stipples is four, whereas it is eight for Disk 1.
  • the stipples are allocated throughout the disk in the same manner.
  • Disk 3 has a stroke size of 4096 blocks and a stroke set size of 4 strokes.
  • Stipple 1 (230) uses the first stroke in each of stroke sets 232, 234, 236, and 238, and stipple 2 (235) uses the second stroke in each of the stroke sets.
  • MEMBER NUMBERS MEMBER NUMBERS
  • Each stroke in a stroke set can have a member number from 0 to (stroke set size - 1). For example, if the stroke set size is 8 strokes, the member numbers can range from 0-7.
  • each stipple can be defined as a one-byte bit mask where the mask indicates the stroke set members that are part of the stipple.
  • each stipple can be defined as a member set array where the array members indicate the stroke set members that are part of that stipple.
  • a stroke set 302 with a Stipple A having a bit mask of 0x55 (0101 0101) or a member set array of ⁇ 0, 2, 4, 6 ⁇ consists of every other stroke (and in this example every other megabyte) across the whole disk starting at stroke 0.
  • Stipple A consumes half the space of the disk since it contains half of the strokes on the disk.
  • a stroke set 304 with a Stipple B having a bit mask of OxOF (0000 1111) or a member set array of ⁇ 0, 1, 2, 3 ⁇ consists of every other 4 strokes (and in this case, every other 4 megabytes) starting at stroke 0 and also consumes half the size of the disk.
  • Stipple A and Stipple B can not appear on the same disk since they overlap.
  • Stipple C with a bit mask of 0x55 (0101 0101) or member set array ⁇ 0, 2, 4, 6 ⁇
  • Stipple D with a bit mask of OxAA (1010 1010) or member set array ⁇ 1, 3, 5, 7 ⁇ , shown in stroke sets 305 and 306 respectively, interlace on every other stroke and split the disk in half. Note that it can be more efficient to have the stroke members of a stipple adjacent to each other as in Stipple B.
  • FIG. 3 A Another example disk shown in FIG. 3 A contains the Stipple Ia (308a) with a bit mask 0x01(0000 0001) or a member array ⁇ 0 ⁇ , Stipple 2a (310a) with a bit mask 0x32 (0011 0010) or a member array ⁇ 1,4,5 ⁇ , and Stipple 3a (312a) with a bit mask 0x44 (0100 0100) or member array ⁇ 2,6 ⁇ , and still have a quarter of the disk available to allocate as one or 2 new stipples.
  • the three stipples respectively contain l/8 th , 3/8*, and 1 A of the disk.
  • the stroke set size of a disk can be changed without remapping existing stipples. For example, if the size of stroke set 313 in FIG. 3 A is multiplied by the integer 2, the stroke set size doubles from a 1 byte bit mask to a 2 byte bit mask. The existing stipples are not remapped, the existing bit mask is applied to the additional strokes.
  • Stipple Ia becomes Stipple Ib (308b) with bit mask OxOlOl and member array ⁇ 0,8 ⁇
  • Stipple 2a becomes Stipple 2b (310b) with bit mask 0x3232 and member array ⁇ 1, 4, 5, 9, 12, 13 ⁇
  • Stipple 3a becomes Stipple 3b (312b) with bit mask 0x4444 or member array ⁇ 2, 6, 10, 14 ⁇ . This would allow the remaining quarter of the disk (i.e., stroke set members 3, 7, 11 and 15) to be divided into one to four new stipples.
  • the stroke size parameter can also be divided evenly by an integer value. This decrease in stroke size causes an increase in the stroke set size.
  • a stroke set 315 has a stroke size of 4096 blocks, a stroke set size of 4, and a stipple 4a using the second stroke of the stroke set. If the stroke size is divided by 2 to make a stroke size of 2048blocks , the stroke set size is increased to 8 (doubled) so that the stipple ratios in the stroke sets, or stipple proportions, are maintained.
  • the new stipple, Stipple 4b includes the third and fourth strokes of the new stroke set as shown in stroke set 316.
  • Process 350 configures the stipples by assigning stroke set members to each stipple and is illustrated in FIG 3B. Two stipples on the same disk cannot contain the same member numbers.
  • Process action 352 the desired fraction of the disk that the stipple requires is determined.
  • Process action 354 determines the stroke set members that are available.
  • the available stroke set members are determined by ORing the masks of the existing stipples and inverting the result. For example, ORing stipple 1 (OxI) and stipple 2 (OxA) is OxB, when inverted the result is 0x4 as the mask of the available stroke set members.
  • the available stroke set members are determined by analyzing the member set arrays of the existing stipples.
  • stipple 1 ⁇ 0 ⁇ and stipple 2 ⁇ 1,3 ⁇ combine to use members ⁇ 0,1,3 ⁇ .
  • the remaining available member in the array is ⁇ 2 ⁇ .
  • Process action 356 assigns one or more available stroke set members to the stipple.
  • the corresponding bit mask for that stipple is set in process action 358.
  • Process action 360 determines if there are more stipples to define. If yes, process 350 returns to process action 352. If there are no more stipples members to define, the process stops. Stipples do not have to be assigned all at once or in adjacent strokes. Stroke set members can be reserved for future use.
  • a stipple can be de-allocated so that the strokes in the stroke set that were being used by the stipple can be reallocated to another stipple.
  • FIG. 4A through 4C are used to illustrate the correlation of a stipple to a disk block and ultimately the conversion of the stipple block number to a disk block number.
  • logical storage 404 in FIG. 4A contains stippled block 401.
  • This stippled block 401 represents a physical disk block 402 in disk 403 on which it resides.
  • the stippled block 401 has a stipple block number that can be converted to a physical disk block number
  • FIG. 4B shows a representation of a set of strokes labeled with disk stroke numbers 480. These strokes are grouped in stroke sets 450 and can be numbered with a stroke set numbers 470. For example, disk strokes 0-31 (480) are shown as grouped into stroke sets 0-7 (471-478). Each stroke set in this example has four members 0-3 as shown in stroke set member numbers 460. For example, stroke set number 0 (471) has stroke set members 0-3, and stroke set number 1 (472) has members 0-3, etc.
  • the stroke set members are assigned to stipples.
  • stipple 1 includes all the 0 stroke set member numbers of the stroke sets, represented as member set array ⁇ 0 ⁇ . These member set arrays are reflected in the stipple members assigned in the column of stroke sets 450.
  • stroke set member number 0 of stroke set 0 (471) is assigned to stipple 1
  • stroke set member number 0 of stroke set 1 (472) is assigned to stipple 1
  • Stipple 2 includes all the stroke set member numbers 1 and 3 represented as member set array ⁇ 1,3 ⁇ .
  • stroke set member numbers 1 and 3 of stroke set 0 (471) are assigned to stipple 2
  • stroke set member numbers 1 and 3 of stroke set 1 (472) are assigned to stipple 2 and so on.
  • the strokes in each stipple can be labeled.
  • the first stroke of stipple 1 in stroke set 451 can be labeled stipple 1, stroke 0 (410).
  • the second stroke of stipple 1 in stroke set 452 is labeled stipple 1, stroke 1 (411), and so on from stroke sets 453 to 458.
  • the first, second, third, and forth strokes of stipple 2 can be labeled stipple 2, stroke 0 (420), stipple 2, stroke 1 (421), stipple, 2, stroke 2 (422) and stipple 2, stroke 3 (423), respectively.
  • the first and second strokes of stipple 2 are in stroke set 451 while the third and fourth strokes of stipple 2 are in stroke set 452 and so on from stroke sets 453 to 458.
  • FIG. 4B shows stroke sets 451-458 are numbered 0-7 in stroke set numbers 471-478 such that, for example, stipple 2, stroke 12 is located in stroke set number 6 (477).
  • each of the virtual stipple blocks such as 401 in FIG. 4A corresponds to a disk block such as 402 in FIG. 4A.
  • the actual physical disk block number is required to find the required data.
  • a conversion process is needed to facilitate determining the disk block number from a stipple block number.
  • arithmetic equations can be used to convert the stipple block number into a disk block number. This embodiment is shown in process 400 of FIG. 4C.
  • the member set of the stipple is represented as an array of indexes rather than as a bit mask. For example, if there are 8 strokes in a stroke set then the Stroke Set Size is 8.
  • the Member Set Array for the example mask 0x32 (0011 0010) is ⁇ 1, 4, 5 ⁇ .
  • the Member Set Size in this example is 3 since there are 3 strokes of the stroke set that are part of this stipple.
  • the Stroke Size in this example is 2048 blocks.
  • Stroke Block Offset Stipple Block Number % Stroke Size
  • the Stipple Stroke Number is calculated by dividing the Stipple Block Number by the Stroke Size, with the Stroke Size having units in blocks.
  • the Stroke Block Offset is obtained by calculating the remainder of the quotient of the Stipple Block Number and the Strike Size in units of blocks. The "%" sign indicates the mathematical operator of modulo which calculates the remainder.
  • Process action 488 calculates the Stroke Set Number using the calculated Stipple Stroke Number divided by the Member Set Size determined in process action 482.
  • Member Set Index is calculated as the remainder of stipple Stroke Number divided by the Member Set Size.
  • Process action 492 calculates Stroke Set Member.
  • Stroke Set Member is the stroke set member number of the member, the Member Set Index is a positional number referring to the first (0), second(l), third(2), etcetera member or each stroke set. For example, if the Member Set Array is ⁇ 0, 2, 4, 6 ⁇ , then a Member Set Index of 3 points to the fourth stroke set member number starting from the lowest member. In this example, the fourth stroke set member number is 6.
  • Process action 494 uses the Stroke Set Member calculated in process action 492 to calculate Disk Stroke Number.
  • Process action 496 uses the Disk Stroke Number to calculates Disk Block Number.
  • Example 1 shows how Stipple block 1,000,000 of the above example stipple would be mapped to a disk block.
  • the inputs are set as follows.
  • Stroke Size is 2048 blocks — one megabyte of 512 byte sectors. Stroke Set Size is 8 strokes — the disk is divided into stroke sets of 8 strokes each. Member Set Size is 3 - this stipple uses 3 strokes of each stroke set - 3/8 th of the disk. Member Set Mask is 0x32 — this identifies which strokes are used in each stroke set. Member Set Array is ⁇ 1, 4, 5 ⁇ — a different representation of the information in the mask. Stipple Block Number is 1,000,000 - the stipple block to be mapped to a disk block.
  • block 1,000,000 of the stipple maps to block 2,665,024 on the disk. Since the stipple consumes 3/8 th of the disk it makes sense that the disk block number is close to 8/3 rd times as large as the stipple block number.
  • Example 2 shows how block number 25000 in stipple number 2, illustrated by element 459 in FIG. 4B, is mapped to a disk block.
  • process action 482 the inputs are set as follows.
  • Stroke Size is 2048 blocks - one megabyte of 512 byte sectors. Stroke Set Size is 4 strokes - the disk is divided into stroke sets of 4 strokes each. Member Set Size is 2 - stipple 2 uses 2 strokes of each stroke set - 1/2 of the disk. Member Set Mask is 0x5 - this identifies which strokes are used in each stroke set. Member Set Array is ⁇ 1, 3 ⁇ - a different representation of the information in the mask.
  • Stipple Block Number is 25,000 - the stipple block to be mapped to a disk block.
  • block number 25000 of stipple number 2 maps to disk block 51,624.
  • process action 494 calculates that the stipple 2 block 25000 corresponds to a Disk Stroke Number of 25 (481). Since the stipple consumes 1/2 of the disk it makes sense that the disk block number is close to 2 times as large as the stipple block number.
  • Stipples can be mirrored by stipples on other disks.
  • a disk may be both stippled and partitioned. Either a stipple can be partitioned (most likely by a host), or a partition can be stippled. Stippling provides a method of dividing a disk into portions that can be treated like virtual whole disks. This new methodology can be useful for a storage array that is presenting portions of a disk as a virtual disk to different hosts.
  • Stippling results in the set of allocated spaces (e.g., virtual disks) being evenly spread across the storage area, or disk.
  • the host that uses the virtual disk can assume that the lower block numbers are closer to the outer rim of the disk and thus perform better. This is helpful for maximizing the utilization of large disks.
  • a small heavily used file system can be placed on the first partition of the virtual disk and a second larger file system can be placed on the remainder of the virtual disk to hold old infrequently accessed data. This can be done without knowing the physical location of the partition underlying the virtual disk and without giving the host an entire physical disk.
  • RAID 5 a single address space is constructed from multiple physical spindles.
  • the RAID 5 space can be divided into stipples as if it is one single disk.
  • the stroke size can be aligned with a multiple of the RAID 5 stripe size. When stippling a RAID 5 disk it makes sense to align the stroke size with the RAID 5 stripes so that each stroke contains an integral number of stripes.
  • Stippling can provide more efficient use of a disk for a system with multiple hosts that cannot coordinate disk allocation with each other.
  • the lower disk addresses of all the virtual disks are on the outer edge of the physical disk.
  • Stippling can be configured such that there are no gaps of unused space between each virtual disk.
  • Stippling can make it easier to manage performance since all the stipples have similar performance.
  • An unused stipple preserves not only its space on the disk, but also a portion of the disk's performance.
  • An unused stipple contains some blocks of every performance characteristic available on the disk.
  • Disk stippling can work with the Automated Storage Management (ASM) product which is commercially available from Oracle Corporation of Redwood Shores, CA.. More information regarding implementation of ASM can be found in U.S. Patent 6,530,035 and U.S. Patent 6,405,284 which are hereby incorporated by reference as if fully set forth herein.
  • the stroke size can be set to match the ASM allocation unit size and the two can be aligned. Each allocation unit can be one stroke on the underlying physical disk. This can keep one megabyte aligned I/O's on contiguous storage all the way from the file I/O down to the physical disk I/O.
  • Stippling can also be applied to support ASM sharing disks between hosts with different operating systems. If the storage array can present virtual disks that are stipples, then disk groups on different hosts can efficiently share the same disks.
  • allocating two partitions on the same disk to the same disk group in a system without stippling is inefficient, resulting in the system trying to load balance between two areas on the same disk and causing many useless seeks.
  • allocating two stipples on the same disk to the same disk group has only minor consequences, resulting in some extents being relocated to the new stipple. But these extents will go to the outer edge of the physical disk along side of the existing data in the other stipple.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Un procédé, système et programme d'allocation d'espace et de performance de disque est décrit. Des pointillés sont entrelacés sur l'ensemble d'un disque pour partager les caractéristiques d'espace et de performance. Le disque est divisé en un certain nombre d'espaces en parties égales (traits). Les traits sont groupés en ensembles de traits. Une partie de chaque ensemble de traits est affectée à chacun d'une pluralité de pointillés.
PCT/US2006/019567 2006-05-19 2006-05-19 Procédé et système de gravure de disque au pointillé WO2007136371A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US2006/019567 WO2007136371A1 (fr) 2006-05-19 2006-05-19 Procédé et système de gravure de disque au pointillé

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2006/019567 WO2007136371A1 (fr) 2006-05-19 2006-05-19 Procédé et système de gravure de disque au pointillé

Publications (1)

Publication Number Publication Date
WO2007136371A1 true WO2007136371A1 (fr) 2007-11-29

Family

ID=37450858

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2006/019567 WO2007136371A1 (fr) 2006-05-19 2006-05-19 Procédé et système de gravure de disque au pointillé

Country Status (1)

Country Link
WO (1) WO2007136371A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0520707A2 (fr) * 1991-06-24 1992-12-30 International Business Machines Corporation Dispositif de stockage de données
EP0664506A2 (fr) * 1994-01-21 1995-07-26 International Business Machines Corporation Système et méthode de définition par l'utilisation d'un format physique d'un dispositif de stockage de données
EP0701246A2 (fr) * 1994-08-10 1996-03-13 International Business Machines Corporation Appareil et méthode pour rendre disponible de données multimédia
US6327641B1 (en) * 1998-03-31 2001-12-04 Texas Instruments Incorporated Method of implementing a geometry per wedge (GPW) based headerless solution in a disk drive formatter and a computer program product incorporating the same

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0520707A2 (fr) * 1991-06-24 1992-12-30 International Business Machines Corporation Dispositif de stockage de données
EP0664506A2 (fr) * 1994-01-21 1995-07-26 International Business Machines Corporation Système et méthode de définition par l'utilisation d'un format physique d'un dispositif de stockage de données
EP0701246A2 (fr) * 1994-08-10 1996-03-13 International Business Machines Corporation Appareil et méthode pour rendre disponible de données multimédia
US6327641B1 (en) * 1998-03-31 2001-12-04 Texas Instruments Incorporated Method of implementing a geometry per wedge (GPW) based headerless solution in a disk drive formatter and a computer program product incorporating the same

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
BIRK Y ED - INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS: "DETERMINISTIC LOAD-BALANCING SCHEMES FOR DISK-BASED VIDEO-ON-DEMANDSTORAGE SERVERS", PROCEEDINGS OF THE 14TH. IEEE SYMPOSIUM ON MASS STORAGE SYSTEMS. STORAGE - AT THE FOREFRONT OF INFORMATION INFRASTRUCTURES. MONTEREY, SEPT. 11 - 14, 1995, PROCEEDINGS OF THE IEEE SYMPOSIUM ON MASS STORAGE SYSTEMS, LOS ALAMITOS, IEEE COMP. SOC. PRESS,, vol. SYMP. 14, 11 September 1995 (1995-09-11), pages 17 - 25, XP000597714, ISBN: 0-7803-3098-6 *
BIRK Y ED - INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS: "Track-pairing: a novel data layout for VOD servers with multi-zone-recording disks", PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS. WASHINGTON, MAY 15 - 18, 1995, LOS ALAMITOS, IEEE COMP. SOC. PRESS, US, 15 May 1995 (1995-05-15), pages 248 - 255, XP010154603, ISBN: 0-8186-7105-X *
CHEN S ET AL: "A novel video layout strategy for near-video-on-demand servers", MULTIMEDIA COMPUTING AND SYSTEMS '97. PROCEEDINGS., IEEE INTERNATIONAL CONFERENCE ON OTTAWA, ONT., CANADA 3-6 JUNE 1997, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 3 June 1997 (1997-06-03), pages 37 - 45, XP010239170, ISBN: 0-8186-7819-4 *
PATTON P H C ET AL: "An efficient disk-array-based server design for a multicast video streaming system", APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, 2003. PROCEEDINGS. IEEE INTERNATIONAL CONFERENCE ON 24-26 JUNE 2003, PISCATAWAY, NJ, USA,IEEE, 24 June 2003 (2003-06-24), pages 262 - 272, XP010645227, ISBN: 0-7695-1992-X *

Similar Documents

Publication Publication Date Title
US9678668B2 (en) System and method for unbalanced RAID management
US8429514B1 (en) Dynamic load balancing of distributed parity in a RAID array
US7594075B2 (en) Metadata for a grid based data storage system
KR102414500B1 (ko) 지능형 데이터 배치
US9459806B2 (en) Combining virtual mapping metadata and physical space mapping metadata
KR102290540B1 (ko) 네임스페이스/스트림 관리
US7237062B2 (en) Storage media data structure system and method
US5758050A (en) Reconfigurable data storage system
US9639268B2 (en) Distributed data storage system with key-based addressing
JP2015503156A5 (fr)
US6983355B2 (en) Virtualization of physical storage using size optimized hierarchical tables
US9448740B2 (en) Storage apparatus and hierarchy control method
US8954658B1 (en) Method of LUN management in a solid state disk array
US20140068181A1 (en) Elastic cache with single parity
US20140019706A1 (en) System and method of logical object management
US20180018096A1 (en) Balanced load distribution for redundant disk array
KR102521051B1 (ko) 하이브리드 데이터 룩-업 방법
CN106656631A (zh) 在共享存储上实现逻辑卷动态分配的方法及系统
US9588693B2 (en) Performing discard commands on RAID storage devices
US20100131733A1 (en) Identification and containment of performance hot-spots in virtual volumes
US20090172244A1 (en) Hierarchical secondary raid stripe mapping
JP5962621B2 (ja) ストレージ装置及びその制御方法、並びにストレージ制御プログラム
US20060259683A1 (en) Method and system for disk stippling
WO2015140931A1 (fr) Système d'enregistrement hiérarchique comportant une zone d'essai, contrôleur d'enregistrement, et programme
US8468303B2 (en) Method and apparatus to allocate area to virtual volume based on object access type

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 06770731

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06770731

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)