US20080244178A1 - Rebalancing of striped disk data - Google Patents
Rebalancing of striped disk data Download PDFInfo
- Publication number
- US20080244178A1 US20080244178A1 US12/137,440 US13744008A US2008244178A1 US 20080244178 A1 US20080244178 A1 US 20080244178A1 US 13744008 A US13744008 A US 13744008A US 2008244178 A1 US2008244178 A1 US 2008244178A1
- Authority
- US
- United States
- Prior art keywords
- storage units
- extents
- total number
- group
- raid arrays
- Prior art date
- Legal status (The legal status 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 status listed.)
- Abandoned
Links
- 238000003860 storage Methods 0.000 claims abstract description 153
- 238000000034 method Methods 0.000 claims abstract description 34
- 238000004519 manufacturing process Methods 0.000 claims abstract description 13
- 238000003491 array Methods 0.000 claims description 103
- 230000008569 process Effects 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 10
- 230000003287 optical effect Effects 0.000 description 7
- 238000013459 approach Methods 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 238000009826 distribution Methods 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002040 relaxant effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 241001522296 Erithacus rubecula Species 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
- 238000003892 spreading Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
- G06F11/1096—Parity calculation or recalculation after configuration or reconfiguration of the system
-
- 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/0604—Improving or facilitating administration, e.g. storage management
- G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
-
- 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/0629—Configuration or reconfiguration of storage systems
- G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
-
- 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/0683—Plurality of storage devices
- G06F3/0689—Disk arrays, e.g. RAID, JBOD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2206/00—Indexing scheme related to dedicated interfaces for computers
- G06F2206/10—Indexing scheme related to storage interfaces for computers, indexing schema related to group G06F3/06
- G06F2206/1012—Load balancing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Provided are a method, system, and article of manufacture, where a plurality of extents are stored in a first set of storage units coupled to a controller. A determination is made that a second set of storage units has been coupled to the controller. The plurality of extents are distributed among all storage units included in the first set of storage units and the second set of storage units.
Description
- This application is a continuation of application Ser. No. 11/286,482 filed on Nov. 23, 2005, which is incorporated herein by reference in its entirety.
- 1. Field
- The disclosure relates to a method, system, and article of manufacture for the rebalancing of striped disk data.
- 2. Background
- In computers that are coupled to a plurality of hard disks, data striping, also referred to as disk striping, is the process of dividing a body of data into stripes and spreading the stripes over a plurality of hard disks.
- Certain system may perform data striping across Redundant Array of Independent Disk (RAID) ranks, where the RAID ranks are also referred to as RAID arrays. RAID is a storage system that uses a plurality of disks to store and distribute data. To perform data striping, the data belonging to a certain logical unit (LUN) may be divided into extents. Successive extents of a volume may then be distributed in a rotating manner across the available RAID ranks. Such striping may allow for the balancing of Input/Output (I/O) load.
- The balancing of I/O load across RAID ranks may be lost if new ranks are added to the set across which data striping has already been performed.
- Provided are a method, system, and article of manufacture, wherein a plurality of extents are stored in a first set of storage units coupled to a controller. A determination is made that a second set of storage units has been coupled to the controller. The plurality of extents are distributed among all storage units included in the first set of storage units and the second set of storage units.
- In certain additional embodiments, the storage units are Redundant Array of Disk (RAID) arrays, wherein the plurality of extents are distributed equally among all the RAID arrays included in the first set of RAID arrays and the second set of RAID arrays, wherein no extent is moved more than once while distributing the plurality of extents among all the RAID arrays, and wherein the plurality of extents are distributed among all the RAID arrays with a minimal number of moves, and wherein the plurality of extents span a volume.
- In yet additional embodiments, the first set of storage units comprise a number of pre-existing RAID arrays, wherein the second set of storage units comprise newly added RAID arrays that are empty, and wherein the pre-existing and the newly added RAID arrays together comprise a total number of RAID arrays. A determination is made of a result by multiplying the number of pre-existing RAID arrays with the total number of RAID arrays. A quotient is determined by dividing the number of the plurality of extents by the result. Groups equal in number to the quotient are generated, wherein each group is assigned extents equal in number to the result. One group is processed, by redistributing the extents assigned to the one group equally among the total number of RAID arrays.
- In further embodiments, the plurality of extents are a first plurality of extents, wherein the first and the second set of storage units together comprise a total number of storage units. A second plurality of extents are stored in the second set of storage units, wherein the first and the second plurality of extents comprise a total number of extents. A result is determined by squaring the total number of storage units. A quotient is determined by dividing the total number of extents by the result. Groups equal in number to the quotient are generated, wherein each group is assigned extents equal in number to the result, and wherein each group includes selected extents from the first and the second set of storage units. One group is processed, by redistributing the extents assigned to the one group equally among the total number of storage units.
- In yet further embodiments, the first and the second set of storage units together comprise a total number of storage units. A determination is made of the least common multiple of the number of storage units in the first set of storage units and the total number of storage units. Groups of storage units are generated, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents. One group is processed, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
- Referring now to the drawings in which like reference numbers represent corresponding parts throughout:
-
FIG. 1 illustrates a block diagram of a computing environment that includes a storage control unit with pre-existing and newly added RAID arrays, in accordance with certain embodiments; -
FIG. 2 illustrates a flowchart for rebalancing extents across all RAID arrays when the newly added RAID arrays are empty, in accordance with certain embodiments; -
FIG. 3 illustrates an example that shows the rebalancing of extents across all RAID arrays when the newly added RAID arrays are empty, in accordance with certain embodiments; -
FIG. 4 illustrates a flowchart for rebalancing extents across all RAID arrays when extents have been stored in the newly added RAID arrays, in accordance with certain embodiments; and -
FIG. 5 illustrates the architecture of computing system, wherein in certain embodiments the storage control unit of the computing environment ofFIG. 1 may be implemented in accordance with the architecture of the computing system. - In the following description, reference is made to the accompanying drawings which form a part hereof and which illustrate several embodiments. It is understood that other embodiments may be utilized and structural and operational changes may be made. For example, the proposed embodiments can be applied regardless of the type of application data being stored in the storage devices.
- Certain embodiments provide for the rebalancing of striped disk data, in response to new ranks being added to the set of disks across which data striping has already been performed. In certain embodiments, logical volumes are striped across an extent pool (with a “strip” size of one extent). Certain embodiments may allow rebalancing of the volume striping pattern after adding one or more new ranks to the pool. In certain embodiments each volume is striped across all of the ranks in the pool, while moving as little data as possible, and without introducing any requirement for temporary disk storage of the data being moved.
- In certain embodiments, the extents of each existing volume are organized into sets of size M, where M is the product of the new and the old number of ranks. Specific extents selected from this group are then moved into the new ranks, in such a way that the distribution of extents is balanced across the new set of ranks.
- In certain other embodiments, a certain number of new volumes may have already been allocated to the new ranks before rebalancing operations are performed. In such a case, groups are formed of a size equal to the square of the new number of ranks, with each group including extents from one old and one new volume. Selected extents are then swapped with each other, in such a way that the distribution of the extents from each volume is striped across the new set of ranks.
-
FIG. 1 illustrates a block diagram of acomputing environment 100 that includes astorage control unit 102 that is coupled to astorage 104 that includespre-existing RAID arrays RAID arrays RAID arrays 108 a . . . 108 m are coupled to thestorage control unit 102, after thestorage control unit 102 has already stored data in the previously coupled pre-existingRAID arrays 106 a . . . 106 n. - The
storage control unit 102, also referred to as a controller, comprises any suitable computational device, including those presently known in the art, such as personal computers, workstations, mainframes, midrange computers, network appliances, palm top computers, telephony devices, blade computers, hand held computers, etc. - While
FIG. 1 illustrates thestorage 104 with pre-existingRAID arrays 106 a . . . 106 n, and newly addedRAID arrays 108 a . . . 108 m, in alternative embodiments thestorage 104 may include storage devices that are different from RAID arrays. For example, instead of or in addition to theRAID arrays 106 a . . . 106 n, 108 a . . . 108 m, thestorage 104 may include tapes, optical devices, etc. -
Extents pre-existing RAID arrays 106 a . . . 106 n. An extent is an element that stores data, where the size of each extent is the same. The size of an extent may vary and may for example be 5 Kbytes in one embodiment, 50 Kbytes in another embodiment, and 1 Mbyte in yet another embodiment. The size of the each extent is small in comparison to the storage capacity of each RAID array. A plurality of extents may belong to the same volume that is being written to thestorage 104. While no extents have been shown in the newly addedRAID arrays 108 a . . . 108 m, extents may be copied or written into thepre-existing RAID arrays 108 a . . . 108 m. - The
storage control unit 102 includes anextent redistributor application 116, where the extent redistributorapplication 116 is capable of rearranging theextents 110 a . . . 110 p, 112 a . . . 112 q, 114 a . . . 114 r among theRAID arrays 106 a . . . 106 n, 108 a . . . 108 m. - In certain embodiments, the extent redistributor
application 116 organizes extents among thepre-existing RAID arrays 106 a . . . 106 n and the newly addedRAID arrays 108 a . . . 108 m, such that the distribution of extents is balanced across thepre-existing RAID arrays 106 a . . . 106 n and the newly addedRAID arrays 108 a . . . 108 m. -
FIG. 2 illustrates a flowchart for rebalancing extents across all RAID arrays in thecomputing environment 100 ofFIG. 1 when the newly addedRAID arrays 108 a . . . 108 m are empty, in accordance with certain embodiments. Certain operations illustrated inFIG. 2 may be implemented in the extent redistributorapplication 116. - The following illustrates certain embodiments, certain aspects of which will be shown later in the flowchart of
FIG. 2 . Suppose that an extent pool initially containsranks rank 2. In order to rebalance, certain embodiments organize the extents of the volume V into groups of 2×3=6. Each group (say group g) of 6 extents will include 3 members inrank rank 1. - For reference, let the three members in
rank 0 be called g0,0, g0,1, and g0,2. Similarly, the three members inrank 1 may be called g1,0, g1,1, and g1,2. - Certain embodiments assign the group of six extents to the three new ranks as follows:
- Rank 0: extent g0,0, extent g0,1
Rank 1: extent g1,0, extent g1,1
Rank 2: extents g0,2, extent g1,2.
Such embodiments avoid making any copies of data except intorank 2. - More specifically in a first approach, in certain embodiments an expansion is needed for the number of ranks in an extent pool from Nold to Nnew. Certain embodiments, proceed by forming the existing extents of a volume into groups of size M=Nold×Nnew. Each group includes Nnew occurrences of each old rank.
- A given group may be built up by separately identifying the extents that belong to each old rank. This can be done by proceeding through the volume extents in Relative Byte Address (RBA) order, keeping a pointer to the most recently added extent belonging to every rank. One extent is added to the first rank, by proceeding forward with the first rank's pointer; then one extent is added to the next rank, by proceeding forward with the next rank's pointer; and so forth, until Nnew extents have been found belonging to each rank. Such embodiments for building the groups avoid making assumptions about the existing pattern of extent assignments.
- Any extents that may be left over, after generating as many evenly balanced groups as possible, are deferred until the end. A second attempt is then made to form the extents that are left over into groups, this time relaxing the requirement to use just one volume in a given group.
- If any extents are still left over, after forming this second set of groups, such extents are ignored. Let the extents in a given group g, included in
rank 0, be numbered g0,0, g0,1, . . . , g0,Nnew-1 and the extents inranks - for i=Nold to Nnew−1; for j=0 to Nold−1;
- allocate the new extent fi,j;
- for i=0 to Nold−1; for j=Nold to Nnew−1;
- move gi,j to fj,i;
- free extent gi,j;
- The number of extents copied is the minimum needed to ensure that each rank contains an equal number of extents from the volume.
- Proceeding now to the flowchart of
FIG. 2 , which illustrates certain aspects of the embodiments for rebalancing striped disk data as implemented in thecomputing environment 100, control starts at control starts atblock 200 where the extent redistributorapplication 116 receives an indication that one ormore RAID arrays 108 a . . . 108 m have been newly added topre-existing RAID arrays 106 a . . . 106 n. - The
extent redistributor application 116 sets (at block 202) M to equal the product of the number of the number ofpre-existing RAID arrays 106 a . . . 106 n and the total number RAID arrays after adding thenew RAID arrays 108 a . . . 108 m. - The
extent redistributor application 116 divides (at block 204) the number of extents in thepre-existing RAID arrays 106 a . . . 106 n by M to determine the quotient and the remainder. The number of groups of extents is assigned (at block 206) to the quotient. - Subsequently, for each group of extents the extent redistributor
application 116 copies (at block 208) extents from thepre-existing RAID arrays 106 a . . . 106 n to the one or more newly addedRAID arrays 108 a . . . 108 m, such that the number of extents in each RAID array is the same. - Control proceeds to block 210, where the extent redistributor
application 116 determines whether the remainder is zero. If so, control proceeds to block 214 and the process of rebalancing terminates. If not, the remainder number of extents are distributed (at block 212) as evenly as possible among theRAID arrays 106 a . . . 106 n, 108 a . . . 108 m, and control proceeds to block 214 where the process of rebalancing terminates. - Therefore,
FIG. 2 illustrates certain embodiments in which no extents have been allocated to the newly addedRAID arrays 108 a . . . 108 m prior to the process of rebalancing the extents within thepre-existing RAID arrays 106 a . . . 106 n and the newly addedRAID arrays 108 a . . . 108 m. Certain embodiments ensure that the number of extents copied is the minimum needed to ensure that each RAID rank contains an equal number of extents from a volume that comprises the extents. -
FIG. 3 illustrates an example that shows the rebalancing of extents across all RAID arrays when the newly added RAID arrays are empty, in accordance with certain embodiments. - In
FIG. 3 thestorage 300 includes three pre-existing RAID arrays and two newly added RAID arrays.Block 302 ofFIG. 3 illustrates how M, quotient, and remainder are calculated in accordance with the logic ofblock FIG. 2 . - Since M is calculated to be 15 and the quotient is 4, block 304 shows four groups being formed where each of the four groups have 15 extents. In addition to the four groups, four
remainder extents 306 are shown inblock 304. -
Block 308 illustrates how the extents of the four groups are redistributed among the five RAID arrays, and how the fourremainder extents 306 are distributed among the five RAID arrays. The logic illustrated in blocks 206-214 ofFIG. 2 may be used to redistribute the extents. -
Block 310 illustrates the number of extents in each of the five RAID arrays after rebalancing. After rebalancing each of the RAID arrays have the extents distributed as evenly as possible. - Therefore,
FIG. 3 illustrates an example for rebalancing extents across RAID arrays in accordance with the logic described inFIG. 2 . -
FIG. 4 illustrates a flowchart for rebalancing extents across all RAID arrays when extents have been stored in the newly addedRAID arrays 108 a . . . 108 m, in accordance with certain embodiments. Certain operations described inFIG. 4 may be implemented in the extent redistributorapplication 116 implemented in thestorage control unit 102. - The following illustrates certain embodiments according to a second approach, certain aspects of which will be shown in the flowchart of
FIG. 4 . Theexemplary steps RAID arrays 108 a . . . 108 m prior to rebalancing: - Step 1: For each volume, form as many groups as possible that have exactly one occurrence of each of the Nnew target ranks. The extents identified in this way are left alone.
Step 2: Form as many groups as possible that have Nnew occurrences of each old rank (labeled gi,j) on one volume, and Nnew occurrences of each added rank (labeled hi,j) on a different volume. Each such group can be rearranged in place with minimum copying. To accomplish the rearrangement with minimum copying, the following set of pairwise extent swaps may be performed: - for i=0 to Nold−1; for j=Nold to Nnew−1;
-
- swap gi,j with hj,i;
Step 3: For each volume, form as many groups as possible of the same type as those just described in the first approach described earlier, and handle the groups in the same way as described earlier for the first approach.
- swap gi,j with hj,i;
- As in the first approach, the handling of left over extents in the extended version is deferred until the end. As many such extents as possible are handled as in Step (1), but this time relaxing the requirement for all members of a group to belong to the same volume. Any remaining extents are then handled as are the deferred extents in the first approach.
- Proceeding now to the flowchart of
FIG. 4 , which illustrates certain aspects of the embodiments for rebalancing striped disk data as implemented in thecomputing environment 100, control starts at control starts atblock 400 where the extent redistributorapplication 116 has balanced thepre-existing RAID arrays 106 a . . . 106 n. - Control proceeds to block 402, where
new RAID arrays 108 a . . . 108 m are added to thepre-existing RAID arrays 106 a . . . 106 n. Extents keep getting added (at block 404) to bothpre-existing RAID arrays 106 a . . . 106 n and thenew RAID arrays 108 a . . . 108 m in accordance with a round robin distribution of the added extents. - The
extent redistributor application 116 determines (at block 406) whether a rebalancing of the extents is needed. If not, control returns to block 404, whereas if a rebalancing of extents is needed the extent redistributorapplication 116 initiates (at block 408) the rebalancing of exents across the RAID arrays. - In certain embodiment, the
extent distributor application 116 sets (at block 410) M to be the square of the total number of RAID arrays. Then atblock 412, for each volume, the extent redistributorapplication 116 divides the number of extents in the pre-existing 106 a . . . 106 n and the newly addedRAID arrays 108 a . . . 108 m by M to determine the quotient and the remainder. Control proceeds to block 414, where the number of groups of exents is assigned to the value of the quotient, where in certain embodiments each group includes extents from one old and one new volume. - The
extent redistributor application 116 swaps (at block 416) extents among all RAID arrays for each group of extents, such that the number of extents in each RAID array is the same, where in certain embodiments each group is rearranged with minimal copying - Control proceeds to block 418, where the extent redistributor
application 116 determines whether the remainder is zero. If so, control proceeds to block 424 and the process of rebalancing terminates. If not, the remainder number of extents are distributed (at block 420) as evenly as possible among theRAID arrays 106 a . . . 106 n, 108 a . . . 108 m, and control proceeds to block 424 where the process of rebalancing terminates. - Therefore,
FIG. 4 illustrates certain embodiments, where the extents are rebalanced after a certain number of extents have been stored in the newly addedRAID arrays 108 a . . . 108 m. -
FIGS. 1-4 illustrate certain embodiments for rebalancing extents, where in some embodiments operations for rebalancing are performed immediately following the addition of the new ranks, while the ranks are still empty. In certain other embodiments, volume allocations may have occurred prior to performing the operations for rebalancing. - In certain alternative embodiments, a determination is made of the least common multiple of the number of storage units, e.g., RAID arrays, in the pre-existing set of storage units and the total number of storage units. Groups of storage units are generated, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents. One group is processed, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
- The described techniques may be implemented as a method, apparatus or article of manufacture involving software, firmware, micro-code, hardware and/or any combination thereof. The term “article of manufacture” as used herein refers to code or logic implemented in a medium, where such medium may comprise hardware logic [e.g., an integrated circuit chip, Programmable Gate Array (PGA), Application Specific Integrated Circuit (ASIC), etc.] or a computer readable medium, such as magnetic storage medium (e.g., hard disk drives, floppy disks, tape, etc.), optical storage (CD-ROMs, optical disks, etc.), volatile and non-volatile memory devices [e.g., Electrically Erasable Programmable Read Only Memory (EEPROM), Read Only Memory (ROM), Programmable Read Only Memory (PROM), Random Access Memory (RAM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), flash, firmware, programmable logic, etc.]. Code in the computer readable medium is accessed and executed by a processor. The medium in which the code or logic is encoded may also comprise transmission signals propagating through space or a transmission media, such as an optical fiber, copper wire, etc. The transmission signal in which the code or logic is encoded may further comprise a wireless signal, satellite transmission, radio waves, infrared signals, Bluetooth, etc. The transmission signal in which the code or logic is encoded is capable of being transmitted by a transmitting station and received by a receiving station, where the code or logic encoded in the transmission signal may be decoded and stored in hardware or a computer readable medium at the receiving and transmitting stations or devices. Additionally, the “article of manufacture” may comprise a combination of hardware and software components in which the code is embodied, processed, and executed. Of course, those skilled in the art will recognize that many modifications may be made without departing from the scope of embodiments, and that the article of manufacture may comprise any information bearing medium. For example, the article of manufacture comprises a storage medium having stored therein instructions that when executed by a machine results in operations being performed.
- Certain embodiments can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.
- Furthermore, certain embodiments can take the form of a computer program product accessible from a computer usable or computer readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk-read only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD.
- The terms “certain embodiments”, “an embodiment”, “embodiment”, “embodiments”, “the embodiment”, “the embodiments”, “one or more embodiments”, “some embodiments”, and “one embodiment” mean one or more (but not all) embodiments unless expressly specified otherwise. The terms “including”, “comprising”, “having” and variations thereof mean “including but not limited to”, unless expressly specified otherwise. The enumerated listing of items does not imply that any or all of the items are mutually exclusive, unless expressly specified otherwise. The terms “a”, “an” and “the” mean “one or more”, unless expressly specified otherwise.
- Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries. Additionally, a description of an embodiment with several components in communication with each other does not imply that all such components are required. On the contrary a variety of optional components are described to illustrate the wide variety of possible embodiments.
- Further, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described does not necessarily indicate a requirement that the steps be performed in that order. The steps of processes described herein may be performed in any order practical. Further, some steps may be performed simultaneously, in parallel, or concurrently.
- When a single device or article is described herein, it will be apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described herein (whether or not they cooperate), it will be apparent that a single device/article may be used in place of the more than one device or article. The functionality and/or the features of a device may be alternatively embodied by one or more other devices which are not explicitly described as having such functionality/features. Thus, other embodiments need not include the device itself.
-
FIG. 5 illustrates anexemplary computer system 500, wherein in certain embodiments thestorage control unit 102 of thecomputing environment 100 ofFIG. 1 may be implemented in accordance with the computer architecture of thecomputer system 500. Thecomputer system 500 may also be referred to as a system, and may include acircuitry 502 that may in certain embodiments include aprocessor 504. Thesystem 500 may also include a memory 506 (e.g., a volatile memory device), andstorage 508. Certain elements of thesystem 500 may or may not be found in thestorage control unit 102. Thestorage 508 may include a non-volatile memory device (e.g., EEPROM, ROM, PROM, RAM, DRAM, SRAM, flash, firmware, programmable logic, etc.), magnetic disk drive, optical disk drive, tape drive, etc. Thestorage 508 may comprise an internal storage device, an attached storage device and/or a network accessible storage device. Thesystem 500 may include aprogram logic 510 includingcode 512 that may be loaded into thememory 506 and executed by theprocessor 504 orcircuitry 502. In certain embodiments, theprogram logic 510 includingcode 512 may be stored in thestorage 508. In certain other embodiments, theprogram logic 510 may be implemented in thecircuitry 502. Therefore, whileFIG. 5 shows theprogram logic 510 separately from the other elements, theprogram logic 510 may be implemented in thememory 506 and/or thecircuitry 502. - Certain embodiments may be directed to a method for deploying computing instruction by a person or automated processing integrating computer-readable code into a computing system, wherein the code in combination with the computing system is enabled to perform the operations of the described embodiments.
- At least certain of the operations illustrated in
FIGS. 2 and 4 may be performed in parallel as well as sequentially. In alternative embodiments, certain of the operations may be performed in a different order, modified or removed. - Furthermore, many of the software and hardware components have been described in separate modules for purposes of illustration. Such components may be integrated into a fewer number of components or divided into a larger number of components. Additionally, certain operations described as performed by a specific component may be performed by other components.
- The data structures and components shown or referred to in
FIGS. 1-5 are described as having specific types of information. In alternative embodiments, the data structures and components may be structured differently and have fewer, more or different fields or different functions than those shown or referred to in the figures. Therefore, the foregoing description of the embodiments has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the embodiments to the precise form disclosed. Many modifications and variations are possible in light of the above teaching.
Claims (16)
1. A method, comprising:
storing a plurality of extents in a first set of storage units coupled to a controller;
determining that a second set of storage units has been coupled to the controller; and
distributing the plurality of extents among all storage units included in the first set of storage units and the second set of storage units.
2. The method of claim 1 , wherein the first set of storage units comprise a number of pre-existing RAID arrays, wherein the second set of storage units comprise newly added RAID arrays that are empty, and wherein the pre-existing and the newly added RAID arrays together comprise a total number of RAID arrays, the method further comprising:
determining a result by multiplying the number of pre-existing RAID arrays with the total number of RAID arrays;
determining a quotient by dividing the number of the plurality of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of RAID arrays.
3. The method of claim 1 , wherein the plurality of extents are a first plurality of extents, wherein the first and the second set of storage units together comprise a total number of storage units, the method further comprising:
storing a second plurality of extents in the second set of storage units, wherein the first and the second plurality of extents comprise a total number of extents;
determining a result by squaring the total number of storage units;
determining a quotient by dividing the total number of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result, and wherein each group includes selected extents from the first and the second set of storage units; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of storage units.
4. The method of claim 1 , wherein the first and the second set of storage units together comprise a total number of storage units, wherein the method further comprises:
determining the least common multiple of the number of storage units in the first set of storage units and the total number of storage units;
generating groups of storage units, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents;
processing one group, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
5. A system coupled to a first set of storage units, and capable of being coupled to a set of second set of storage units, the system comprising:
a memory; and
processor coupled to the memory, wherein the processor is operable to:
(i) store a plurality of extents in the first set of storage units;
(ii) determine that the second set of storage units has been coupled to the system; and
(iii) distribute the plurality of extents among all storage units included in the first set of storage units and the second set of storage units.
6. The system of claim 5 , wherein the first set of storage units comprise a number of pre-existing RAID arrays, wherein the second set of storage units comprise newly added RAID arrays that are empty, wherein the pre-existing and the newly added RAID arrays together comprise a total number of RAID arrays, and wherein the processor is further operable to:
determine a result by multiplying the number of pre-existing RAID arrays with the total number of RAID arrays;
determine a quotient by dividing the number of the plurality of extents by the result;
generate groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result; and
process one group, by redistributing the extents assigned to the one group equally among the total number of RAID arrays.
7. The system of claim 5 , wherein the plurality of extents are a first plurality of extents, wherein the first and the second set of storage units together comprise a total number of storage units, and wherein the processor is further operable to:
store a second plurality of extents in the second set of storage units, wherein the first and the second plurality of extents comprise a total number of extents;
determine a result by squaring the total number of storage units;
determine a quotient by dividing the total number of extents by the result;
generate groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result, and wherein each group includes selected extents from the first and the second set of storage units; and
process one group, by redistributing the extents assigned to the one group equally among the total number of storage units.
8. The system of claim 5 , wherein the first and the second set of storage units together comprise a total number of storage units, and wherein the processor is further operable to:
determine the least common multiple of the number of storage units in the first set of storage units and the total number of storage units;
generate groups of storage units, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents;
process one group, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
9. An article of manufacture for controlling a first and a second set of storage units, wherein the first set of storage units is coupled to a controller, wherein the second set of storage units is capable of being coupled to the controller, and wherein the article of manufacture causes operations, the operations comprising:
storing a plurality of extents in the first set of storage units coupled to the controller;
determining that a second set of storage units has been coupled to the controller; and
distributing the plurality of extents among all storage units included in the first set of storage units and the second set of storage units.
10. The article of manufacture of claim 9 , wherein the first set of storage units comprise a number of pre-existing RAID arrays, wherein the second set of storage units comprise newly added RAID arrays that are empty, and wherein the pre-existing and the newly added RAID arrays together comprise a total number of RAID arrays, the operations further comprising:
determining a result by multiplying the number of pre-existing RAID arrays with the total number of RAID arrays;
determining a quotient by dividing the number of the plurality of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of RAID arrays.
11. The article of manufacture of claim 9 , wherein the plurality of extents are a first plurality of extents, wherein the first and the second set of storage units together comprise a total number of storage units, the operations further comprising:
storing a second plurality of extents in the second set of storage units, wherein the first and the second plurality of extents comprise a total number of extents;
determining a result by squaring the total number of storage units;
determining a quotient by dividing the total number of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result, and wherein each group includes selected extents from the first and the second set of storage units; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of storage units.
12. The article of manufacture of claim 9 , wherein the first and the second set of storage units together comprise a total number of storage units, the operations further comprising:
determining the least common multiple of the number of storage units in the first set of storage units and the total number of storage units;
generating groups of storage units, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents;
processing one group, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
13. A method for deploying computing infrastructure, comprising integrating computer-readable code into a computing system, wherein the code in combination with the computing system is capable of performing:
storing a plurality of extents in a first set of storage units coupled to the computing system;
determining that a second set of storage units has been coupled to the computing system; and
distributing the plurality of extents among all storage units included in the first set of storage units and the second set of storage units.
14. The method for deploying computing infrastructure of claim 13 , wherein the first set of storage units comprise a number of pre-existing RAID arrays, wherein the second set of storage units comprise newly added RAID arrays that are empty, and wherein the pre-existing and the newly added RAID arrays together comprise a total number of RAID arrays, the method further comprising:
determining a result by multiplying the number of pre-existing RAID arrays with the total number of RAID arrays;
determining a quotient by dividing the number of the plurality of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of RAID arrays.
15. The method for deploying computing infrastructure of claim 13 , wherein the plurality of extents are a first plurality of extents, wherein the first and the second set of storage units together comprise a total number of storage units, the method further comprising:
storing a second plurality of extents in the second set of storage units, wherein the first and the second plurality of extents comprise a total number of extents;
determining a result by squaring the total number of storage units;
determining a quotient by dividing the total number of extents by the result;
generating groups equal in number to the quotient, wherein each group is assigned extents equal in number to the result, and wherein each group includes selected extents from the first and the second set of storage units; and
processing one group, by redistributing the extents assigned to the one group equally among the total number of storage units.
16. The method for deploying computing infrastructure of claim 13 , wherein the first and the second set of storage units together comprise a total number of storage units, wherein the method further comprises:
determining the least common multiple of the number of storage units in the first set of storage units and the total number of storage units;
generating groups of storage units, wherein each group is assigned the least common multiple number of extents selected from the plurality of extents;
processing one group, by redistributing the assigned extents of the one group equally among the total number of storage units, wherein the redistributing is based on performing a minimum number of copy operations from the first to the second set of storage units.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/137,440 US20080244178A1 (en) | 2005-11-23 | 2008-06-11 | Rebalancing of striped disk data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/286,482 US7404036B2 (en) | 2005-11-23 | 2005-11-23 | Rebalancing of striped disk data |
US12/137,440 US20080244178A1 (en) | 2005-11-23 | 2008-06-11 | Rebalancing of striped disk data |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/286,482 Continuation US7404036B2 (en) | 2005-11-23 | 2005-11-23 | Rebalancing of striped disk data |
Publications (1)
Publication Number | Publication Date |
---|---|
US20080244178A1 true US20080244178A1 (en) | 2008-10-02 |
Family
ID=38054810
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/286,482 Active 2026-09-27 US7404036B2 (en) | 2005-11-23 | 2005-11-23 | Rebalancing of striped disk data |
US12/137,440 Abandoned US20080244178A1 (en) | 2005-11-23 | 2008-06-11 | Rebalancing of striped disk data |
US12/137,444 Active 2026-06-09 US7818501B2 (en) | 2005-11-23 | 2008-06-11 | Rebalancing of striped disk data |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/286,482 Active 2026-09-27 US7404036B2 (en) | 2005-11-23 | 2005-11-23 | Rebalancing of striped disk data |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/137,444 Active 2026-06-09 US7818501B2 (en) | 2005-11-23 | 2008-06-11 | Rebalancing of striped disk data |
Country Status (4)
Country | Link |
---|---|
US (3) | US7404036B2 (en) |
JP (1) | JP4856515B2 (en) |
CN (1) | CN100561416C (en) |
TW (1) | TWI408549B (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080235449A1 (en) * | 2005-11-23 | 2008-09-25 | International Business Machines Corporation | Rebalancing of striped disk data |
US20120054248A1 (en) * | 2010-08-25 | 2012-03-01 | International Business Machines Corporation | Database Rebalancing in Hybrid Storage Environment |
US20160371011A1 (en) * | 2011-01-28 | 2016-12-22 | International Business Machines Corporation | Assigning device adaptors to use to copy source extents to target extents in a copy relationship |
Families Citing this family (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7841533B2 (en) | 2003-11-13 | 2010-11-30 | Metrologic Instruments, Inc. | Method of capturing and processing digital images of an object within the field of view (FOV) of a hand-supportable digitial image capture and processing system |
JP5379956B2 (en) * | 2007-03-19 | 2013-12-25 | 株式会社日立製作所 | Storage device and storage area arrangement method |
JP5332364B2 (en) * | 2007-10-16 | 2013-11-06 | 富士通株式会社 | Distributed storage management program, distributed storage management apparatus, and distributed storage management method |
WO2010047710A1 (en) * | 2008-10-23 | 2010-04-29 | Hewlett-Packard Development Company, L.P. | Direct attached storage system and method for implementing multiple simultaneous storage schemes |
WO2010122674A1 (en) | 2009-04-23 | 2010-10-28 | 株式会社日立製作所 | Computer system and method for controlling same |
EP2302498B1 (en) * | 2009-04-23 | 2014-11-12 | Hitachi, Ltd. | Computer system and method for controlling same |
US8230189B1 (en) * | 2010-03-17 | 2012-07-24 | Symantec Corporation | Systems and methods for off-host backups of striped volumes |
US8527677B1 (en) * | 2010-06-25 | 2013-09-03 | Altera Corporation | Serial communications links with bonded first-in-first-out buffer circuitry |
JP5593577B2 (en) * | 2010-12-27 | 2014-09-24 | 株式会社日立製作所 | Storage system and control method thereof |
US9015411B2 (en) * | 2011-12-02 | 2015-04-21 | Compellent Technologies | System and method for unbalanced raid management |
JP6056769B2 (en) | 2011-12-19 | 2017-01-11 | 富士通株式会社 | Storage system, data rebalancing program, and data rebalancing method |
KR101734160B1 (en) * | 2016-04-28 | 2017-05-11 | 주식회사 디에이아이오 | Storage device for alleviating skewed workload |
JP6253752B1 (en) * | 2016-11-29 | 2017-12-27 | 株式会社東芝 | Tiered storage system |
US10678643B1 (en) * | 2017-04-26 | 2020-06-09 | EMC IP Holding Company LLC | Splitting a group of physical data storage drives into partnership groups to limit the risk of data loss during drive rebuilds in a mapped RAID (redundant array of independent disks) data storage system |
US10324662B2 (en) * | 2017-08-28 | 2019-06-18 | International Business Machines Corporation | Rebalancing of the first extents of logical volumes among a plurality of ranks |
CN109725830B (en) * | 2017-10-27 | 2022-02-08 | 伊姆西Ip控股有限责任公司 | Method, apparatus and storage medium for managing redundant array of independent disks |
US10628061B2 (en) * | 2018-04-27 | 2020-04-21 | Veritas Technologies Llc | Systems and methods for rebalancing striped information across multiple storage devices |
CN110737402B (en) * | 2018-07-20 | 2023-12-08 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer storage medium for managing storage system |
US10496316B1 (en) * | 2018-10-31 | 2019-12-03 | EMC IP Holding Company LLC | Forming storage containers from extents having different widths within a group of storage devices |
CN111858188A (en) * | 2019-04-29 | 2020-10-30 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for storage management |
US11023147B2 (en) * | 2019-10-10 | 2021-06-01 | EMC IP Holding Company LLC | Mapping storage extents into resiliency groups |
CN112748862A (en) * | 2019-10-31 | 2021-05-04 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer program product for managing disc |
CN112748864B (en) * | 2019-10-31 | 2024-04-19 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer program product for allocating storage discs |
CN115220646A (en) * | 2021-04-21 | 2022-10-21 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for managing a storage system |
Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6425052B1 (en) * | 1999-10-28 | 2002-07-23 | Sun Microsystems, Inc. | Load balancing configuration for storage arrays employing mirroring and striping |
US20020124137A1 (en) * | 2001-01-29 | 2002-09-05 | Ulrich Thomas R. | Enhancing disk array performance via variable parity based load balancing |
US20020156973A1 (en) * | 2001-01-29 | 2002-10-24 | Ulrich Thomas R. | Enhanced disk array |
US20030046497A1 (en) * | 2001-08-28 | 2003-03-06 | Dandrea Robert G. | Method and apparatus for stripping data onto a plurality of disk drives |
US20030065883A1 (en) * | 1997-10-06 | 2003-04-03 | Eitan Bachmat | Program and apparatus for balancing activity of disk storage devices in response to statistical analyses and preliminary testing |
US20030093619A1 (en) * | 2001-11-14 | 2003-05-15 | Hitachi, Inc. | Management method and apparatus for storage apparatus |
US6629202B1 (en) * | 1999-11-29 | 2003-09-30 | Microsoft Corporation | Volume stacking model |
US6728831B1 (en) * | 1998-10-23 | 2004-04-27 | Oracle International Corporation | Method and system for managing storage systems containing multiple data storage devices |
US6862692B2 (en) * | 2001-01-29 | 2005-03-01 | Adaptec, Inc. | Dynamic redistribution of parity groups |
US20050144511A1 (en) * | 2003-12-25 | 2005-06-30 | Yung-Chao Chih | Disk array system with fail-over and load-balance functions |
US20060184731A1 (en) * | 2003-11-24 | 2006-08-17 | Corbett Peter F | Data placement technique for striping data containers across volumes of a storage system cluster |
US20060248273A1 (en) * | 2005-04-29 | 2006-11-02 | Network Appliance, Inc. | Data allocation within a storage system architecture |
US20070143541A1 (en) * | 2005-12-19 | 2007-06-21 | Lsi Logic Corporation | Methods and structure for improved migration of raid logical volumes |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5502836A (en) * | 1991-11-21 | 1996-03-26 | Ast Research, Inc. | Method for disk restriping during system operation |
US5809224A (en) * | 1995-10-13 | 1998-09-15 | Compaq Computer Corporation | On-line disk array reconfiguration |
US5758118A (en) * | 1995-12-08 | 1998-05-26 | International Business Machines Corporation | Methods and data storage devices for RAID expansion by on-line addition of new DASDs |
JP3170455B2 (en) * | 1996-05-27 | 2001-05-28 | インターナショナル・ビジネス・マシーンズ・コーポレ−ション | Method of relocating data in data storage system, method of accessing data stored in the system, and data storage system |
JP3748631B2 (en) * | 1996-08-19 | 2006-02-22 | 株式会社エクシング | Logical storage area integration method and disk array apparatus |
US5933834A (en) * | 1997-10-16 | 1999-08-03 | International Business Machines Incorporated | System and method for re-striping a set of objects onto an exploded array of storage units in a computer system |
JP2000242434A (en) * | 1998-12-22 | 2000-09-08 | Hitachi Ltd | Storage device system |
US6651154B1 (en) * | 2000-07-11 | 2003-11-18 | International Business Machines Corporation | Method, system, and program for expanding the storage space in an array of storage units |
WO2003077111A1 (en) * | 2002-03-13 | 2003-09-18 | Fujitsu Limited | Controller for raid device |
US7159150B2 (en) * | 2002-12-31 | 2007-01-02 | International Business Machines Corporation | Distributed storage system capable of restoring data in case of a storage failure |
JP4215606B2 (en) * | 2003-09-24 | 2009-01-28 | 日本電気株式会社 | Disk array device, storage capacity expansion method and program |
US7404036B2 (en) * | 2005-11-23 | 2008-07-22 | International Business Machines Corporation | Rebalancing of striped disk data |
-
2005
- 2005-11-23 US US11/286,482 patent/US7404036B2/en active Active
-
2006
- 2006-09-22 CN CNB2006101393107A patent/CN100561416C/en active Active
- 2006-10-23 JP JP2006287230A patent/JP4856515B2/en active Active
- 2006-11-08 TW TW095141324A patent/TWI408549B/en active
-
2008
- 2008-06-11 US US12/137,440 patent/US20080244178A1/en not_active Abandoned
- 2008-06-11 US US12/137,444 patent/US7818501B2/en active Active
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030065883A1 (en) * | 1997-10-06 | 2003-04-03 | Eitan Bachmat | Program and apparatus for balancing activity of disk storage devices in response to statistical analyses and preliminary testing |
US6728831B1 (en) * | 1998-10-23 | 2004-04-27 | Oracle International Corporation | Method and system for managing storage systems containing multiple data storage devices |
US6425052B1 (en) * | 1999-10-28 | 2002-07-23 | Sun Microsystems, Inc. | Load balancing configuration for storage arrays employing mirroring and striping |
US6629202B1 (en) * | 1999-11-29 | 2003-09-30 | Microsoft Corporation | Volume stacking model |
US20020124137A1 (en) * | 2001-01-29 | 2002-09-05 | Ulrich Thomas R. | Enhancing disk array performance via variable parity based load balancing |
US20020156973A1 (en) * | 2001-01-29 | 2002-10-24 | Ulrich Thomas R. | Enhanced disk array |
US6862692B2 (en) * | 2001-01-29 | 2005-03-01 | Adaptec, Inc. | Dynamic redistribution of parity groups |
US20030046497A1 (en) * | 2001-08-28 | 2003-03-06 | Dandrea Robert G. | Method and apparatus for stripping data onto a plurality of disk drives |
US20030093619A1 (en) * | 2001-11-14 | 2003-05-15 | Hitachi, Inc. | Management method and apparatus for storage apparatus |
US20060184731A1 (en) * | 2003-11-24 | 2006-08-17 | Corbett Peter F | Data placement technique for striping data containers across volumes of a storage system cluster |
US20050144511A1 (en) * | 2003-12-25 | 2005-06-30 | Yung-Chao Chih | Disk array system with fail-over and load-balance functions |
US20060248273A1 (en) * | 2005-04-29 | 2006-11-02 | Network Appliance, Inc. | Data allocation within a storage system architecture |
US20070143541A1 (en) * | 2005-12-19 | 2007-06-21 | Lsi Logic Corporation | Methods and structure for improved migration of raid logical volumes |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080235449A1 (en) * | 2005-11-23 | 2008-09-25 | International Business Machines Corporation | Rebalancing of striped disk data |
US7818501B2 (en) | 2005-11-23 | 2010-10-19 | International Business Machines Corporation | Rebalancing of striped disk data |
US20120054248A1 (en) * | 2010-08-25 | 2012-03-01 | International Business Machines Corporation | Database Rebalancing in Hybrid Storage Environment |
US8307014B2 (en) * | 2010-08-25 | 2012-11-06 | International Business Machines Corporation | Database rebalancing in hybrid storage environment |
US20160371011A1 (en) * | 2011-01-28 | 2016-12-22 | International Business Machines Corporation | Assigning device adaptors to use to copy source extents to target extents in a copy relationship |
US9928004B2 (en) * | 2011-01-28 | 2018-03-27 | International Business Machines Corporation | Assigning device adaptors to use to copy source extents to target extents in a copy relationship |
Also Published As
Publication number | Publication date |
---|---|
TW200805135A (en) | 2008-01-16 |
JP4856515B2 (en) | 2012-01-18 |
US7404036B2 (en) | 2008-07-22 |
CN100561416C (en) | 2009-11-18 |
JP2007149068A (en) | 2007-06-14 |
TWI408549B (en) | 2013-09-11 |
US20070118689A1 (en) | 2007-05-24 |
CN1971499A (en) | 2007-05-30 |
US7818501B2 (en) | 2010-10-19 |
US20080235449A1 (en) | 2008-09-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7818501B2 (en) | Rebalancing of striped disk data | |
US8140785B2 (en) | Updating metadata in a logical volume associated with a storage controller for data units indicated in a data structure | |
US6728832B2 (en) | Distribution of I/O requests across multiple disk units | |
JP4206586B2 (en) | Database management method and apparatus, and storage medium storing database management program | |
US5392244A (en) | Memory systems with data storage redundancy management | |
US5758118A (en) | Methods and data storage devices for RAID expansion by on-line addition of new DASDs | |
US9928004B2 (en) | Assigning device adaptors to use to copy source extents to target extents in a copy relationship | |
CN101504594B (en) | Data storage method and apparatus | |
CN107807794A (en) | A kind of date storage method and device | |
CN108536392B (en) | Mixed data searching method | |
US8065466B2 (en) | Library apparatus, library system and method for copying logical volume to disk volume in cache disk with smallest access load | |
US8055839B2 (en) | Maintaining reserved free space at the end of a physical volume for creating new segments of segmented logical volumes in the reserved free space | |
CN107729536A (en) | A kind of date storage method and device | |
US7392361B2 (en) | Generic reallocation function for heap reconstitution in a multi-processor shared memory environment | |
US7856540B2 (en) | System and article of manufacture for removing alias addresses from an alias address pool | |
US7975100B2 (en) | Segmentation of logical volumes and movement of selected segments when a cache storage is unable to store all segments of a logical volume | |
US20110258485A1 (en) | Transitional replacement of operations performed by a central hub |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |