US20060129738A1 - Data allocation in a distributed storage system - Google Patents

Data allocation in a distributed storage system Download PDF

Info

Publication number
US20060129738A1
US20060129738A1 US11/345,781 US34578106A US2006129738A1 US 20060129738 A1 US20060129738 A1 US 20060129738A1 US 34578106 A US34578106 A US 34578106A US 2006129738 A1 US2006129738 A1 US 2006129738A1
Authority
US
United States
Prior art keywords
logical addresses
storage devices
data
devices
redistributing
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
Application number
US11/345,781
Inventor
Ofir Zohar
Yaron Revah
Haim Helman
Dror Cohen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to US11/345,781 priority Critical patent/US20060129738A1/en
Publication of US20060129738A1 publication Critical patent/US20060129738A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • 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
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
    • G06F11/2056—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant by mirroring
    • G06F11/2087—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant by mirroring with a common controller
    • 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/0632—Configuration or reconfiguration of storage systems by initialisation or re-initialisation of 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/0629—Configuration or reconfiguration of storage systems
    • G06F3/0635—Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
    • 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
    • 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/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0647—Migration mechanisms

Definitions

  • the present invention relates generally to data storage, and specifically to data storage in distributed data storage entities.
  • a distributed data storage system typically comprises cache memories that are coupled to a number of disks wherein the data is permanently stored.
  • the disks may be in the same general location, or be in completely different locations.
  • the caches may be localized or distributed.
  • the storage system is normally used by one or more hosts external to the system.
  • Using more than one cache and more than one disk leads to a number of very practical advantages, such as protection against complete system failure if one of the caches or one of the disks malfunctions. Redundancy may be incorporated into a multiple cache or multiple disk system, so that failure of a cache or a disk in the distributed storage system is not apparent to one of the external hosts, and has little effect on the functioning of the system.
  • While distribution of the storage elements has undoubted advantages, the fact of the distribution typically leads to increased overhead compared to a local system having a single cache and a single disk.
  • the increased overhead is required to manage the increased number of system components, to equalize or attempt to equalize usage of the components, to maintain redundancy among the components, to operate a backup system in the case of a failure of one of the components, and to manage addition of components to, or removal of components from, the system.
  • a reduction in the required overhead for a distributed storage system is desirable.
  • U.S. Pat. No. 6,434,666 to Takahashi, et al. whose disclosure is incorporated herein by reference, describes a memory control apparatus.
  • the apparatus is interposed between a central processing unit (CPU) and a memory device that stores data.
  • the apparatus has a plurality of cache memories to temporarily store data which is transferred between the CPU and the memory device, and a cache memory control unit which selects the cache memory used to store the data being transferred.
  • a data distribution system comprises a plurality of data storage devices wherein data blocks may be stored.
  • the data blocks are stored at logical addresses that are assigned to the data storage devices according to a procedure which allocates the addresses among the devices in a manner that reduces the overhead incurred when a device is added to or removed from the system, and so as to provide a balanced access to the devices.
  • the procedure typically distributes the addresses evenly among the devices, regardless of the number of devices in the system. If a storage device is added to or removed from the system, the procedure reallocates the logical addresses between the new numbers of devices so that the balanced access is maintained. If a device has been added, the procedure only transfers addresses to the added storage device.
  • the procedure only transfers addresses from the removed storage device. In both cases, the only transfers of data that occur are of data blocks stored at the transferred addresses. The procedure thus minimizes data transfer and associated management overhead when the number of storage devices is changed, or when the device configuration is changed, while maintaining the balanced access.
  • the procedure comprises a consistent hashing function.
  • the function is used to allocate logical addresses for data block storage to the storage devices at initialization of the storage system.
  • the same function is used to consistently reallocate the logical addresses and data blocks stored therein when the number of devices in the system changes.
  • the procedure comprises allocating the logical addresses between the devices according to a randomizing process at initialization.
  • the randomizing process generates a table giving a correspondence between specific logical addresses and the devices.
  • the same randomizing process is used to reallocate the logical addresses and their stored data blocks on a change of storage devices
  • the procedure comprises allocating two copies of a logical address to two separate storage devices, the two devices being used to store copies of a data block, so that the data block is protected against device failure.
  • the procedure spreads the data block copies uniformly across all the storage devices. On failure of any one of the devices, copies of data blocks of the failed device are still spread uniformly across the remaining devices, and are immediately available to the system. Consequently, device failure has a minimal effect on the performance of the distribution system.
  • a method for data distribution including:
  • redistributing the logical addresses consists of no transfer of the logical addresses between the storage devices in the initial set.
  • distributing the logical addresses includes applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses consists of applying the consistent hashing function to the extended set of storage devices so as to determine respective subsequent locations of the logical addresses among the extended set.
  • distributing the logical addresses includes applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses consists of applying the randomizing function to the extended set of storage devices so as to determine respective subsequent locations of the logical addresses among the extended set.
  • At least one of the storage devices preferably includes a fast access time memory; alternatively or additionally, at least one of the storage devices preferably includes a slow access time mass storage device.
  • the storage devices have substantially equal capacities, and distributing the logical addresses includes distributing the logical addresses substantially evenly among the initial set, and redistributing the logical addresses consists of redistributing the logical addresses substantially evenly among the extended set.
  • a first storage device of the storage devices has a first capacity different from a second capacity of a second storage device of the storage devices, and distributing the logical addresses includes distributing the logical addresses substantially according to a ratio of the first capacity to the second capacity, and redistributing the logical addresses includes redistributing the logical addresses substantially according to the ratio.
  • distributing the logical addresses includes allocating a specific logical address to a first storage device and to a second storage device, the first and second storage devices being different storage devices, and storing the data consists of storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
  • the method preferably includes writing the data from a host external to the storage devices, and reading the data to the external host from the storage devices.
  • an alternative method for distributing data including:
  • redistributing the logical addresses consists of no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
  • Distributing the logical addresses preferably consists of applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • distributing the logical addresses consists of applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses includes applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • the storage devices preferably have substantially equal capacities, and distributing the logical addresses consists of distributing the logical addresses substantially evenly among the initial set, and redistributing the logical addresses includes redistributing the logical addresses substantially evenly among the depleted set.
  • a method for distributing data among a set of storage devices including:
  • a method for distributing data among a set of storage devices including:
  • a data distribution system including:
  • an additional storage device to the initial set, thus forming an extended set of the storage devices comprising the initial set and the additional storage device, the logical addresses being redistributed among the storage devices in the extended set so as to cause a portion of the logical addresses to be transferred from the storage devices in the initial set to the additional storage device, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the initial set.
  • a data distribution system including:
  • a depleted set of storage devices formed by subtracting a surplus storage device from the initial set, the logical addresses being redistributed among the storage devices in the depleted set so as to cause logical addresses of the surplus device to be transferred to the depleted set, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the depleted set.
  • redistributing the logical addresses comprises no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
  • the distributed logical addresses are preferably determined by applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • the distributed logical addresses are determined by applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • the storage devices preferably have substantially equal capacities, and the distributed logical addresses are distributed substantially evenly among the initial set, and redistributing the logical addresses includes redistributing the logical addresses substantially evenly among the depleted set.
  • a first storage device included in the storage devices has a first capacity different from a second capacity of a second storage device included in the storage devices, and the distributed logical addresses are distributed substantially according to a ratio of the first capacity to the second capacity, and redistributing the logical addresses includes redistributing the logical addresses substantially according to the ratio.
  • the distributed logical addresses include a specific logical address allocated to a first storage device and a second storage device, the first and second storage devices being different storage devices, and storing the data includes storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
  • the system preferably includes a memory having a table wherein is stored a correspondence between a plurality of logical addresses and a specific storage device in the initial set, wherein the plurality of logical addresses are related to each other by a mathematical relation.
  • a data distribution system including:
  • subsets of the storage devices formed by subtracting the respective primary storage devices from the set, the consistent hashing function being applied to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices, data being stored on the respective primary storage devices and a copy of the data being stored on the respective secondary storage devices in accordance with the logical addresses.
  • a data distribution system including:
  • subsets of the storage devices formed by subtracting the respective primary storage devices from the set, the randomizing function being applied to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices, data being stored on the respective primary storage devices and a copy of the data being stored on the respective secondary storage devices in accordance with the logical addresses.
  • FIG. 1 illustrates distribution of data addresses among data storage devices, according to a preferred embodiment of the present invention
  • FIG. 2 is a flowchart describing a procedure for allocating addresses to the devices of FIG. 1 , according to a preferred embodiment of the present invention
  • FIG. 3 is a flowchart describing an alternative procedure for allocating addresses to the devices of FIG. 1 , according to a preferred embodiment of the present invention
  • FIG. 4 is a schematic diagram illustrating reallocation of addresses when a storage device is removed from the devices of FIG. 1 , according to a preferred embodiment of the present invention
  • FIG. 5 is a schematic diagram illustrating reallocation of addresses when a storage device is added to the devices of FIG. 1 , according to a preferred embodiment of the present invention
  • FIG. 6 is a flowchart describing a procedure that is a modification of the procedure of FIG. 2 , according to a preferred embodiment of the present invention
  • FIG. 7 is a schematic diagram which illustrates a fully mirrored distribution of data for the devices of FIG. 1 , according to a preferred embodiment of the present invention.
  • FIG. 8 is a flowchart describing a procedure for performing the distribution of FIG. 7 , according to a preferred embodiments of the present invention.
  • a storage system 12 comprises a plurality of separate storage devices 14 , 16 , 18 , 20 , and 22 , also respectively referred to herein as storage devices B 1 , B 2 , B 3 , B 4 , and B 5 , and collectively as devices B n . It will be understood that system 12 may comprise substantially any number of physically separate devices, and that the five devices B n used herein are by way of example. Devices B n comprise any components wherein data 34 , also herein termed data D, may be stored, processed, and/or serviced.
  • Examples of devices B n comprise random access memory (RAM) which has a fast access time and which are typically used as caches, disks which typically have a slow access time, or any combination of such components.
  • RAM random access memory
  • a host 24 communicates with system 12 in order to read data from, or write data to, the system.
  • a central processing unit (CPU) 26 using a memory 28 , manages system 12 , and allocates data D to devices B n . The allocation of data D by CPU 26 to devices B n is described in more detail below.
  • Data D is processed in devices B n at logical block addresses (LBAs) of the devices by being written to the devices from host 24 and/or read from the devices by host 24 .
  • LBAs logical block addresses
  • CPU 26 distributes the LBAs of devices B n among the devices using one of the pre-defined procedures described below. CPU 26 may then store data D at the LBAs.
  • devices B n are assumed to have substantially equal capacities, where the capacity of a specific device is a function of the device type.
  • the capacity is typically defined in terms of quantity of data the device may store.
  • the capacity is typically defined in terms of throughput of the device.
  • the procedures allocate the logical stripes to devices B n so that balanced access to the devices is maintained, where balanced access assumes that taken over approximately 10,000 ⁇ N transactions with devices B n , the fraction of capacities of devices B n used are equal to within approximately 1%, where N is the number of devices B n , the values being based on a Bernoulli distribution.
  • FIG. 2 is a flowchart describing a procedure 50 for allocating LBAs to devices B n , according to a preferred embodiment of the present invention.
  • the LBAs are assumed to be grouped into k logical stripes/tracks, hereinbelow termed stripes 36 ( FIG. 1 ), which are numbered 1, . . . , k, where k is a whole number.
  • Each logical stripe comprises one or more consecutive LBAs, and all the stripes have the same length.
  • Procedure 50 uses a randomizing function to allocate a stripe s to devices B n in system 12 .
  • the allocations determined by procedure 50 are stored in a table 32 of memory 28 .
  • CPU 26 determines an initial value of s, the total number T d of active devices B n in system 12 , and assigns each device B n a unique integral identity between 1 and T d .
  • the CPU generates a random integer R between 1 and T d , and allocates stripe s to the device B n corresponding to R.
  • the allocation determined in step 54 is stored in table 32 .
  • Procedure 50 continues, in a step 58 , by incrementing the value of s, until all stripes of device B n have been allocated, i.e., until s>k, at which point procedure 50 terminates.
  • the identifying integers for each device B n as determined by CPU 26 in step 52 , are assumed to be 1 for B 1 , 2 for B 1 , 2 for B 5 .
  • TABLE I Random Stripe s Number R Device B s 1 3 B 3 2 5 B 5 . . . . . . .
  • FIG. 3 is a flowchart showing steps of a procedure 70 using a consistent hashing function to allocate stripes to devices B n , according to an alternative preferred embodiment of the present invention.
  • CPU 26 determines a maximum number N of devices B n for system 12 , and a number of points k for each device. The CPU then determines an integer M, such that M>>N ⁇ k.
  • Each random value S ab is chosen from ⁇ 0, 1, 2, . . . , M ⁇ 1 ⁇ , and the value of each S ab may not repeat, i.e., each value may only appear once in all the sets.
  • the sets of random values are stored in memory 28 .
  • a third step 76 for each stripe s CPU 26 determines a value of s mod(M) and then a value of F(s mod(M)), where F is a permutation function that reassigns the value of s mod(M) so that in a final step 78 consecutive stripes will generally be mapped to different devices B n .
  • step 78 the CPU finds, typically using an iterative search process, the random value chosen in step 74 that is closest to F(s mod(M)).
  • CPU 26 then assigns the device B n of the random value to stripe s, according to equations (1).
  • procedure 70 illustrates one type of consistent hashing function, and that other such functions may be used by system 12 to allocate LBAs to devices operating in the system. All such consistent hashing functions are assumed to be comprised within the scope of the present invention.
  • Procedure 70 may be incorporated into memory 28 of system 12 ( FIG. 1 ), and the procedure operated by CPU 26 when allocation of stripes s are required, such as when data is to be read from or written to system 12 .
  • a table 30 of the results of applying procedure 70 may be stored in memory 28 , and accessed by CPU 26 as required.
  • FIG. 4 is a schematic diagram illustrating reallocation of stripes when a storage device is removed from storage system 12 , according to a preferred embodiment of the present invention.
  • Device B 3 may be no longer active for a number of reasons known in the art, such as device failure, or the device becoming surplus to the system, and such a device is herein termed a surplus device.
  • Table II illustrates reallocation of stripes for device B 3 (from the allocation shown in Table I).
  • procedure 50 only generates transfer of stripes from the device that is no longer active in system 12 , and that the procedure reallocates the stripes, and any data stored therein, substantially evenly over the remaining active devices of the system. No reallocation of stripes occurs in system 12 other than stripes that were initially allocated to the device that is no longer active. Similarly, no transfer of data occurs other than data that was initially in the device that is no longer active. Also, any such transfer of data may be performed by CPU 26 transferring the data directly from the inactive device to the reallocated device, with no intermediate device needing to be used.
  • procedure 70 ( FIG. 3 )
  • procedure 70 only generates transfer of stripes, and reallocation of data stored therein, from the device that is no longer active in system 12 , i.e., device B 3 .
  • Procedure 70 reallocates the stripes (and thus their data) from B 3 substantially evenly over the remaining devices B 1 , B 2 , B 4 , B 5 of the system, no reallocation of stripes or data occurs in system 12 other than stripes/data that were initially in B 3 , and such data transfer as may be necessary may be performed by direct transfer to the remaining active devices. It will also be understood that if B 3 is returned to system 12 at some future time, the allocation of stripes after procedure 70 is implemented is the same as the initial allocation generated by the procedure.
  • FIG. 5 is a schematic diagram illustrating reallocation of stripes when a storage device is added to storage system 12 , according to a preferred embodiment of the present invention.
  • a device 23 also herein termed device B 6
  • stripes from devices B 1 , B 2 , B 3 , B 4 , B 5 are substantially evenly removed from the devices and are transferred to device B 6 .
  • B 1 , B 2 , B 3 , B 4 , B 5 , B 6 act as an extended set of the initial set.
  • FIG. 6 is a flowchart describing a procedure 90 that is a modification of procedure 50 ( FIG. 2 ), according to an alternative preferred embodiment of the present invention.
  • procedure 90 is generally similar to procedure 50 , so that steps indicated by the same reference numerals in both procedures are generally identical in implementation.
  • procedure 90 uses a randomizing function to allocate stripes s to devices B n in system 12 , when a device is added to the system.
  • the allocations determined by procedure 90 are stored in table 32 of memory 28 .
  • procedure 90 only generates transfer of stripes, and thus reallocation of data, to device B 6 .
  • the procedure reallocates the stripes to B 6 by transferring stripes, substantially evenly, from devices B 1 , B 2 , B 3 , B 4 , B 5 of the system, and no transfer of stripes, or data stored therein, occurs in system 12 other than stripes/data transferred to B 6 . Any such data transfer may be made directly to device B 6 , without use of an intermediate device B n .
  • procedure 70 may be applied when device B 6 is added to system 12 .
  • procedure 70 shows that similar results to those of procedure 90 apply, i.e., that there is only reallocation of stripes, and data stored therein, to device B 6 .
  • procedure 70 generates substantially even reallocation of stripes/data from the other devices of the system.
  • FIG. 7 is a schematic diagram which illustrates a fully mirrored distribution of data D in storage system 12 ( FIG. 1 ), and FIG. 8 is a flowchart illustrating a procedure 100 for performing the distribution, according to preferred embodiments of the present invention.
  • Procedure 100 allocates each specific stripe to a primary device B n1 , and a copy of the specific stripe to a secondary device B n2 , n1 ⁇ tn2, so that each stripe is mirrored.
  • CPU 26 determines primary device B n1 for locating a stripe using procedure 50 or procedure 70 .
  • CPU 26 determines secondary device B n2 for the stripe using procedure 50 or procedure 70 , assuming that device B n1 is not available.
  • CPU 26 allocates copies of the strip to devices B n1 and B n2 , and writes the device identifies to a table 34 in memory 28 , for future reference.
  • CPU 26 implements procedure 100 for all stripes 36 in devices B n .
  • Table IV below illustrates devices B n1 and B n2 determined for stripes 6058-6078 of Table I, where procedure 50 .
  • Stripe Device B n1 Device B n2 6058 B 2 B 4 6059 B 2 B 5 6060 B 4 B 2 6061 B 5 B 4 6062 B 3 B 1 6063 B 5 B 4 6064 B 1 B 3 6065 B 3 B 4 6066 B 2 B 5 6067 B 3 B 1 6068 B 1 B 3 6069 B 2 B 5 6070 B 4 B 1 6071 B 5 B 3 6072 B 4 B 2 6073 B 1 B 3 6074 B 5 B 1 6075 B 3 B 5 6076 B 1 B 3 6077 B 2 B 4 6078 B 4 B 1
  • CPU 26 may implement a procedure similar to procedure 100 to generate a new second copy of the stripes that were on the unavailable device. For example, if after allocating stripes 6058-6078 according to Table IV, device B 3 becomes unavailable, copies of stripes 6062, 6065, 6067, and 6075, need to be allocated to new devices in system 12 to maintain full mirroring. Procedure 100 may be modified to find the new device of each stripe by assuming that the remaining device, as well as device B 3 , is unavailable. Thus, for stripe 6062 , CPU 26 assumes that devices B 1 and B 3 are unavailable, and determines that instead of device B 3 the stripe should be written to device B 4 .
  • Table V below shows the devices that the modified procedure 100 determines for stripes 6058 , 6060 , 6062 , 6065 , 6072 , and 6078 , when B 3 becomes unavailable. TABLE V Stripe s Device B n1 Device B n2 6062 B 1 B 2 6065 B 4 B 5 6067 B 1 B 4 6075 B 5 B 2
  • procedure 100 spreads locations for stripes 36 substantially evenly across all devices B n , while ensuring that each pair of copies of any particular stripe are on different devices, as is illustrated in FIG. 7 . Furthermore, the even distribution of locations is maintained even when one of devices B n , becomes unavailable. Either copy, or both copies, of any particular stripe may be used when host 24 communicates with system 12 . It will also be appreciated that in the event of one of devices B n becoming unavailable, procedure 100 regenerates secondary locations for copies of stripes 36 that are evenly distributed over devices B n .
  • the sizes of tables 30 , 32 , or 34 are a function of the number of stripes in system 12 , as well as the number of storage devices in the system. Some preferred embodiments of the present invention reduce the sizes of tables 30 , 32 , or 34 by duplicating some of the entries of the tables, by relating different stripes mathematically. For example, if system 12 comprises 2,000,000 stripes, the same distribution may apply to every 500,000 stripes, as illustrated in Table VI below. Table VI is derived from Table I. TABLE VI Stripe s Stripe s Stripe s Stripe s Device B s 1 500,001 1,000,001 1,500,001 B 3 2 500,002 1,000,002 1,500,002 B 5 . . . . .
  • a storage system may comprise a distributed fast access cache coupled to a distributed slow access mass storage.
  • a distributed fast access cache coupled to a distributed slow access mass storage.
  • the fast access cache may be assigned addresses according to procedure 50 or modifications of procedure 50
  • the slow access mass storage may be assigned addresses according to procedure 70 or modifications of procedure 70 .

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)
  • Computer Networks & Wireless Communication (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Multi Processors (AREA)
  • Computer And Data Communications (AREA)

Abstract

A method for data distribution, including distributing logical addresses among an initial set of devices so as provide balanced access, and transferring the data to the devices in accordance with the logical addresses. If a device is added to the initial set, forming an extended set, the logical addresses are redistributed among the extended set so as to cause some logical addresses to be transferred from the devices in the initial set to the additional device. There is substantially no transfer of the logical addresses among the initial set. If a surplus device is removed from the initial set, forming a depleted set, the logical addresses of the surplus device are redistributed among the depleted set. There is substantially no transfer of the logical addresses among the depleted set. In both cases the balanced access is maintained.

Description

    CROSS-REFERENCE TO RELATED APPLICATION
  • This application is divisional of U.S. patent application Ser. No. 10/620,080 filed Jul. 15, 2003, the content of which is incorporated herein by reference.
    • FIELD OF THE INVENTION
  • The present invention relates generally to data storage, and specifically to data storage in distributed data storage entities.
    • BACKGROUND OF THE INVENTION
  • A distributed data storage system typically comprises cache memories that are coupled to a number of disks wherein the data is permanently stored. The disks may be in the same general location, or be in completely different locations. Similarly, the caches may be localized or distributed. The storage system is normally used by one or more hosts external to the system.
  • Using more than one cache and more than one disk leads to a number of very practical advantages, such as protection against complete system failure if one of the caches or one of the disks malfunctions. Redundancy may be incorporated into a multiple cache or multiple disk system, so that failure of a cache or a disk in the distributed storage system is not apparent to one of the external hosts, and has little effect on the functioning of the system.
  • While distribution of the storage elements has undoubted advantages, the fact of the distribution typically leads to increased overhead compared to a local system having a single cache and a single disk. Inter alia, the increased overhead is required to manage the increased number of system components, to equalize or attempt to equalize usage of the components, to maintain redundancy among the components, to operate a backup system in the case of a failure of one of the components, and to manage addition of components to, or removal of components from, the system. A reduction in the required overhead for a distributed storage system is desirable.
  • An article titled “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” by Karger et al., in the Proceedings of the 29th ACM Symposium on Theory of Computing, pages 654-663, (May 1997), whose disclosure is incorporated herein by reference, describes caching protocols for relieving “hot spots” in distributed networks. The article describes a hashing technique of consistent hashing, and the use of a consistent hashing function. Such a function allocates objects to devices so as to spread the objects evenly over the devices, so that there is a minimal redistribution of objects if there is a change in the devices, and so that the allocation is consistent, i.e., is reproducible. The article applies a consistent hashing function to read-only cache systems, i.e., systems where a client may only read data from the cache system, not write data to the system, in order to distribute input/output requests to the systems. A read-only cache system is used in much of the World Wide Web, where a typical user is only able to read from sites on the Web having such a system, not write to such sites.
  • An article titled “Differentiated Object Placement and Location for Self-Organizing Storage Clusters,” by Tang et al., in Technical Report 2002-32 of the University of California, Santa Barbara (November, 2002), whose disclosure is incorporated herein by reference, describes a protocol for managing a storage system where components are added or removed from the system. The protocol uses a consistent hashing scheme for placement of small objects in the system. Large objects are placed in the system according to a usage-based policy.
  • An article titled “Compact, Adaptive Placement Schemes for Non-Uniform Capacities,” by Brinkmann et al., in the August, 2002, Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architecures (SPAA), whose disclosure is incorporated herein by reference, describes two strategies for distributing objects among a heterogeneous set of servers. Both strategies are based on hashing systems.
  • U.S. Pat. No. 5,875,481 to Ashton, et al., whose disclosure is incorporated herein by reference, describes a method for dynamic reconfiguration of data storage devices. The method assigns a selected number of the data storage devices as input devices and a selected number of the data storage devices as output devices in a predetermined input/output ratio, so as to improve data transfer efficiency of the storage devices.
  • U.S. Pat. No. 6,317,815 to Mayer, et al., whose disclosure is incorporated herein by reference, describes a method and apparatus for reformatting a main storage device of a computer system. The main storage device is reformatted by making use of a secondary storage device on which is stored a copy of the data stored on the main device.
  • U.S. Pat. No. 6,434,666 to Takahashi, et al., whose disclosure is incorporated herein by reference, describes a memory control apparatus. The apparatus is interposed between a central processing unit (CPU) and a memory device that stores data. The apparatus has a plurality of cache memories to temporarily store data which is transferred between the CPU and the memory device, and a cache memory control unit which selects the cache memory used to store the data being transferred.
  • U.S. Pat. No. 6,453,404 to Bereznyi, et al., whose disclosure is incorporated herein by reference, describes a cache system that allocates memory for storage of data items by defining a series of small blocks that are uniform in size. The cache system, rather than an operating system, assigns one or more blocks for storage of a data item.
    • SUMMARY OF THE INVENTION
  • It is an object of some aspects of the present invention to provide a system for distributed data allocation.
  • In preferred embodiments of the present invention, a data distribution system comprises a plurality of data storage devices wherein data blocks may be stored. The data blocks are stored at logical addresses that are assigned to the data storage devices according to a procedure which allocates the addresses among the devices in a manner that reduces the overhead incurred when a device is added to or removed from the system, and so as to provide a balanced access to the devices. The procedure typically distributes the addresses evenly among the devices, regardless of the number of devices in the system. If a storage device is added to or removed from the system, the procedure reallocates the logical addresses between the new numbers of devices so that the balanced access is maintained. If a device has been added, the procedure only transfers addresses to the added storage device. If a device has been removed, the procedure only transfers addresses from the removed storage device. In both cases, the only transfers of data that occur are of data blocks stored at the transferred addresses. The procedure thus minimizes data transfer and associated management overhead when the number of storage devices is changed, or when the device configuration is changed, while maintaining the balanced access.
  • In some preferred embodiments of the present invention, the procedure comprises a consistent hashing function. The function is used to allocate logical addresses for data block storage to the storage devices at initialization of the storage system. The same function is used to consistently reallocate the logical addresses and data blocks stored therein when the number of devices in the system changes. Alternatively, the procedure comprises allocating the logical addresses between the devices according to a randomizing process at initialization. The randomizing process generates a table giving a correspondence between specific logical addresses and the devices. The same randomizing process is used to reallocate the logical addresses and their stored data blocks on a change of storage devices
  • In some preferred embodiments of the present invention, the procedure comprises allocating two copies of a logical address to two separate storage devices, the two devices being used to store copies of a data block, so that the data block is protected against device failure. The procedure spreads the data block copies uniformly across all the storage devices. On failure of any one of the devices, copies of data blocks of the failed device are still spread uniformly across the remaining devices, and are immediately available to the system. Consequently, device failure has a minimal effect on the performance of the distribution system.
  • There is therefore provided, according to a preferred embodiment of the present invention, a method for data distribution, including:
  • distributing logical addresses among an initial set of storage devices so as provide a balanced access to the devices;
  • transferring the data to the storage devices in accordance with the logical addresses;
  • adding an additional storage device to the initial set, thus forming an extended set of the storage devices consisting of the initial set and the additional storage device; and
  • redistributing the logical addresses among the storage devices in the extended set so as to cause a portion of the logical addresses to be transferred from the storage devices in the initial set to the additional storage device, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the initial set.
  • Preferably, redistributing the logical addresses consists of no transfer of the logical addresses between the storage devices in the initial set.
  • Preferably, distributing the logical addresses includes applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses consists of applying the consistent hashing function to the extended set of storage devices so as to determine respective subsequent locations of the logical addresses among the extended set.
  • Alternatively, distributing the logical addresses includes applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses consists of applying the randomizing function to the extended set of storage devices so as to determine respective subsequent locations of the logical addresses among the extended set.
  • At least one of the storage devices preferably includes a fast access time memory; alternatively or additionally, at least one of the storage devices preferably includes a slow access time mass storage device.
  • Preferably, the storage devices have substantially equal capacities, and distributing the logical addresses includes distributing the logical addresses substantially evenly among the initial set, and redistributing the logical addresses consists of redistributing the logical addresses substantially evenly among the extended set.
  • Alternatively, a first storage device of the storage devices has a first capacity different from a second capacity of a second storage device of the storage devices, and distributing the logical addresses includes distributing the logical addresses substantially according to a ratio of the first capacity to the second capacity, and redistributing the logical addresses includes redistributing the logical addresses substantially according to the ratio.
  • Preferably, distributing the logical addresses includes allocating a specific logical address to a first storage device and to a second storage device, the first and second storage devices being different storage devices, and storing the data consists of storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
  • The method preferably includes writing the data from a host external to the storage devices, and reading the data to the external host from the storage devices.
  • There is further provided, according to a preferred embodiment of the present invention, an alternative method for distributing data, including:
  • distributing logical addresses among an initial set of storage devices so as provide a balanced access to the devices;
  • transferring the data to the storage devices in accordance with the logical addresses;
  • removing a surplus device from the initial set, thus forming a depleted set of the storage devices comprising the initial storage devices less the surplus storage device; and
  • redistributing the logical addresses among the storage devices in the depleted set so as to cause logical addresses of the surplus device to be transferred to the depleted set, while maintaining the balanced access and without requiring a substantial transfer of logical addresses among the storage devices in the depleted set.
  • Preferably, redistributing the logical addresses consists of no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
  • Distributing the logical addresses preferably consists of applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • Alternatively, distributing the logical addresses consists of applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses includes applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • The storage devices preferably have substantially equal capacities, and distributing the logical addresses consists of distributing the logical addresses substantially evenly among the initial set, and redistributing the logical addresses includes redistributing the logical addresses substantially evenly among the depleted set.
  • There is further provided, according to a preferred embodiment of the present invention, a method for distributing data among a set of storage devices, including:
  • applying a consistent hashing function to the set so as to allocate logical addresses to respective primary storage devices of the set and so as to provide a balanced access to the devices;
  • forming subsets of the storage devices by subtracting the respective primary storage devices from the set;
  • applying the consistent hashing function to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices; and
  • storing the data on the respective primary storage devices and a copy of the data on the respective secondary storage devices in accordance with the logical addresses.
  • There is further provided, according to a preferred embodiment of the present invention, a method for distributing data among a set of storage devices, including:
  • applying a randomizing function to the set so as to allocate logical addresses to respective primary storage devices of the set and so as to provide a balanced access to the devices;
  • forming subsets of the storage devices by subtracting the respective primary storage devices from the set;
  • applying the randomizing function to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices; and
  • storing the data on the respective primary storage devices and a copy of the data on the respective secondary storage devices in accordance with the logical addresses.
  • There is further provided, according to a preferred embodiment of the present invention, a data distribution system, including:
  • an initial set of storage devices among which are distributed logical addresses so as provide a balanced access to the devices, and wherein data is stored in accordance with the logical addresses; and
  • an additional storage device to the initial set, thus forming an extended set of the storage devices comprising the initial set and the additional storage device, the logical addresses being redistributed among the storage devices in the extended set so as to cause a portion of the logical addresses to be transferred from the storage devices in the initial set to the additional storage device, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the initial set.
  • There is further provided, according to a preferred embodiment of the present invention, a data distribution system, including:
  • an initial set of storage devices among which are distributed logical addresses so as provide a balanced access to the devices, and wherein data is stored in accordance with the logical addresses; and
  • a depleted set of storage devices, formed by subtracting a surplus storage device from the initial set, the logical addresses being redistributed among the storage devices in the depleted set so as to cause logical addresses of the surplus device to be transferred to the depleted set, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the depleted set.
  • Preferably, redistributing the logical addresses comprises no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
  • The distributed logical addresses are preferably determined by applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • Alternatively, the distributed logical addresses are determined by applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and redistributing the logical addresses preferably includes applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
  • The storage devices preferably have substantially equal capacities, and the distributed logical addresses are distributed substantially evenly among the initial set, and redistributing the logical addresses includes redistributing the logical addresses substantially evenly among the depleted set.
  • Alternatively or additionally, a first storage device included in the storage devices has a first capacity different from a second capacity of a second storage device included in the storage devices, and the distributed logical addresses are distributed substantially according to a ratio of the first capacity to the second capacity, and redistributing the logical addresses includes redistributing the logical addresses substantially according to the ratio.
  • Preferably, the distributed logical addresses include a specific logical address allocated to a first storage device and a second storage device, the first and second storage devices being different storage devices, and storing the data includes storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
  • The system preferably includes a memory having a table wherein is stored a correspondence between a plurality of logical addresses and a specific storage device in the initial set, wherein the plurality of logical addresses are related to each other by a mathematical relation.
  • There is further provided, according to a preferred embodiment of the present invention, a data distribution system, including:
  • a set of data storage devices to which is applied a consistent hashing function so as to allocate logical addresses to respective primary storage devices of the set and so as to provide a balanced access to the devices; and
  • subsets of the storage devices formed by subtracting the respective primary storage devices from the set, the consistent hashing function being applied to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices, data being stored on the respective primary storage devices and a copy of the data being stored on the respective secondary storage devices in accordance with the logical addresses.
  • There is further provided, according to a preferred embodiment of the present invention, a data distribution system, including:
  • a set of data storage devices to which is applied a randomizing function so as to allocate logical addresses to respective primary storage devices of the set and so as to provide a balanced access to the devices; and
  • subsets of the storage devices formed by subtracting the respective primary storage devices from the set, the randomizing function being applied to the subsets so as to allocate the logical addresses to respective secondary storage devices of the subsets while maintaining the balanced access to the devices, data being stored on the respective primary storage devices and a copy of the data being stored on the respective secondary storage devices in accordance with the logical addresses.
  • The present invention will be more fully understood from the following detailed description of the preferred embodiments thereof, taken together with the drawings, a brief description of which is given below.
    • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 illustrates distribution of data addresses among data storage devices, according to a preferred embodiment of the present invention;
  • FIG. 2 is a flowchart describing a procedure for allocating addresses to the devices of FIG. 1, according to a preferred embodiment of the present invention;
  • FIG. 3 is a flowchart describing an alternative procedure for allocating addresses to the devices of FIG. 1, according to a preferred embodiment of the present invention;
  • FIG. 4 is a schematic diagram illustrating reallocation of addresses when a storage device is removed from the devices of FIG. 1, according to a preferred embodiment of the present invention;
  • FIG. 5 is a schematic diagram illustrating reallocation of addresses when a storage device is added to the devices of FIG. 1, according to a preferred embodiment of the present invention;
  • FIG. 6 is a flowchart describing a procedure that is a modification of the procedure of FIG. 2, according to a preferred embodiment of the present invention;
  • FIG. 7 is a schematic diagram which illustrates a fully mirrored distribution of data for the devices of FIG. 1, according to a preferred embodiment of the present invention; and
  • FIG. 8 is a flowchart describing a procedure for performing the distribution of FIG. 7, according to a preferred embodiments of the present invention.
    • DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
  • Reference is now made to FIG. 1, which illustrates distribution of data addresses among data storage devices, according to a preferred embodiment of the present invention. A storage system 12 comprises a plurality of separate storage devices 14, 16, 18, 20, and 22, also respectively referred to herein as storage devices B1, B2, B3, B4, and B5, and collectively as devices Bn. It will be understood that system 12 may comprise substantially any number of physically separate devices, and that the five devices Bn used herein are by way of example. Devices Bn comprise any components wherein data 34, also herein termed data D, may be stored, processed, and/or serviced. Examples of devices Bn comprise random access memory (RAM) which has a fast access time and which are typically used as caches, disks which typically have a slow access time, or any combination of such components. A host 24 communicates with system 12 in order to read data from, or write data to, the system. A central processing unit (CPU) 26, using a memory 28, manages system 12, and allocates data D to devices Bn. The allocation of data D by CPU 26 to devices Bn is described in more detail below.
  • Data D is processed in devices Bn at logical block addresses (LBAs) of the devices by being written to the devices from host 24 and/or read from the devices by host 24. At initialization of system 12 CPU 26 distributes the LBAs of devices Bn among the devices using one of the pre-defined procedures described below. CPU 26 may then store data D at the LBAs.
  • In the description of the procedures hereinbelow, devices Bn are assumed to have substantially equal capacities, where the capacity of a specific device is a function of the device type. For example, for devices that comprise mass data storage devices having slow access times, such as disks, the capacity is typically defined in terms of quantity of data the device may store. For devices that comprise fast access time memories, such as are used in caches, the capacity is typically defined in terms of throughput of the device. Those skilled in the art will be able to adapt the procedures when devices Bn have different capacities, in which case ratios of the capacities are typically used to determine the allocations. The procedures allocate the logical stripes to devices Bn so that balanced access to the devices is maintained, where balanced access assumes that taken over approximately 10,000×N transactions with devices Bn, the fraction of capacities of devices Bn used are equal to within approximately 1%, where N is the number of devices Bn, the values being based on a Bernoulli distribution.
  • FIG. 2 is a flowchart describing a procedure 50 for allocating LBAs to devices Bn, according to a preferred embodiment of the present invention. The LBAs are assumed to be grouped into k logical stripes/tracks, hereinbelow termed stripes 36 (FIG. 1), which are numbered 1, . . . , k, where k is a whole number. Each logical stripe comprises one or more consecutive LBAs, and all the stripes have the same length. Procedure 50 uses a randomizing function to allocate a stripe s to devices Bn in system 12. The allocations determined by procedure 50 are stored in a table 32 of memory 28.
  • In an initial step 52, CPU 26 determines an initial value of s, the total number Td of active devices Bn in system 12, and assigns each device Bn a unique integral identity between 1 and Td. In a second step 54, the CPU generates a random integer R between 1 and Td, and allocates stripe s to the device Bn corresponding to R. In a third step 56, the allocation determined in step 54 is stored in table 32. Procedure 50 continues, in a step 58, by incrementing the value of s, until all stripes of device Bn have been allocated, i.e., until s>k, at which point procedure 50 terminates.
  • Table I below is an example of an allocation table generated by procedure 50, for system 12, wherein Td=5. The identifying integers for each device Bn, as determined by CPU 26 in step 52, are assumed to be 1 for B1, 2 for B1, 2 for B5.
    TABLE I
    Random
    Stripe s Number R Device B s
      1 3 B 3
      2 5 B5
    . . . . . . . . .
    6058 2 B2
    6059 2 B2
    6060 4 B4
    6061 5 B5
    6062 3 B3
    6063 5 B5
    6064 1 B1
    6065 3 B3
    6066 2 B2
    6067 3 B3
    6068 1 B1
    6069 2 B2
    6070 4 B4
    6071 5 B5
    6072 4 B4
    6073 1 B1
    6074 5 B5
    6075 3 B3
    6076 1 B1
    6077 2 B2
    6078 4 B4
    . . . . . . . . .
  • FIG. 3 is a flowchart showing steps of a procedure 70 using a consistent hashing function to allocate stripes to devices Bn, according to an alternative preferred embodiment of the present invention. In an initial step 72, CPU 26 determines a maximum number N of devices Bn for system 12, and a number of points k for each device. The CPU then determines an integer M, such that M>>N·k.
  • In a second step 74, CPU 26 determines N sets Jn of k random values Sab, each set corresponding to a possible device Bn, as given by equations (1):
    J1={S11, S12, . . . , S1k} for device B1;
    J2={S21, S22, . . . , S2k}for device B2;
    JN={SN1, SN2, . . . , SNk} for device BN.  (1)
  • Each random value Sab is chosen from {0, 1, 2, . . . , M−1}, and the value of each Sab may not repeat, i.e., each value may only appear once in all the sets. The sets of random values are stored in memory 28.
  • In a third step 76, for each stripe s CPU 26 determines a value of s mod(M) and then a value of F(s mod(M)), where F is a permutation function that reassigns the value of s mod(M) so that in a final step 78 consecutive stripes will generally be mapped to different devices Bn.
  • In final step 78, the CPU finds, typically using an iterative search process, the random value chosen in step 74 that is closest to F(s mod(M)). CPU 26 then assigns the device Bn of the random value to stripe s, according to equations (1).
  • It will be appreciated that procedure 70 illustrates one type of consistent hashing function, and that other such functions may be used by system 12 to allocate LBAs to devices operating in the system. All such consistent hashing functions are assumed to be comprised within the scope of the present invention.
  • Procedure 70 may be incorporated into memory 28 of system 12 (FIG. 1), and the procedure operated by CPU 26 when allocation of stripes s are required, such as when data is to be read from or written to system 12. Alternatively, a table 30 of the results of applying procedure 70, generally similar to the first and last columns of Table I, may be stored in memory 28, and accessed by CPU 26 as required.
  • FIG. 4 is a schematic diagram illustrating reallocation of stripes when a storage device is removed from storage system 12, according to a preferred embodiment of the present invention. By way of example, device B3 is assumed to be no longer active in system 12 at a time t=1, after initialization time t=1, and the stripes initially allocated to the device, and any data stored therein, are reallocated to the depleted set of devices B1, B2, B4, B5 of the system. Device B3 may be no longer active for a number of reasons known in the art, such as device failure, or the device becoming surplus to the system, and such a device is herein termed a surplus device. The reallocation is performed using procedure 50 or procedure 70, preferably according to the procedure that was used at time t=0. As is illustrated in FIG. 4, and as is described below, stripes from device B3 are substantially evenly redistributed among devices B1, B2, B4, B5.
  • If procedure 50 (FIG. 2) is applied at t=1, the procedure is applied to the stripes of device B3, so as to randomly assign the stripes to the remaining active devices of system 12. In this case, at step 52 the total number of active devices Td=4, and identifying integers for each active device Bn are assumed to be 1 for B1, 2 for B2, B4, 3 for B5. CPU 26 generates a new table, corresponding to the first and last columns of Table II below for the stripes that were allocated to B3 at t=0, and the stripes are reassigned according to the new table. Table II illustrates reallocation of stripes for device B3 (from the allocation shown in Table I).
    TABLE II
    Random
    Device Bs Number R Device Bs
    Stripe s t = 0 t = 1 t = 1
      1 B3 1 B1
      2 B5 B5
    . . . . . . . . . . . .
    6058 B2 B2
    6059 B2 B2
    6060 B4 B4
    6061 B5 B5
    6062 B3 3 B5
    6063 B5 B5
    6064 B1 B1
    6065 B3 2 B2
    6066 B2 B2
    6067 B3 3 B5
    6068 B1 B1
    6069 B2 B2
    6070 B4 B4
    6071 B5 B5
    6072 B4 B4
    6073 B1 B1
    6074 B5 B5
    6075 B3 4 B4
    6076 B1 B1
    6077 B2 B2
    6078 B4 B4
    . . . . . . . . . . . .
  • It will be appreciated that procedure 50 only generates transfer of stripes from the device that is no longer active in system 12, and that the procedure reallocates the stripes, and any data stored therein, substantially evenly over the remaining active devices of the system. No reallocation of stripes occurs in system 12 other than stripes that were initially allocated to the device that is no longer active. Similarly, no transfer of data occurs other than data that was initially in the device that is no longer active. Also, any such transfer of data may be performed by CPU 26 transferring the data directly from the inactive device to the reallocated device, with no intermediate device needing to be used.
  • Similarly, by consideration of procedure 70 (FIG. 3), it will be appreciated that procedure 70 only generates transfer of stripes, and reallocation of data stored therein, from the device that is no longer active in system 12, i.e., device B3. Procedure 70 reallocates the stripes (and thus their data) from B3 substantially evenly over the remaining devices B1, B2, B4, B5 of the system, no reallocation of stripes or data occurs in system 12 other than stripes/data that were initially in B3, and such data transfer as may be necessary may be performed by direct transfer to the remaining active devices. It will also be understood that if B3 is returned to system 12 at some future time, the allocation of stripes after procedure 70 is implemented is the same as the initial allocation generated by the procedure.
  • FIG. 5 is a schematic diagram illustrating reallocation of stripes when a storage device is added to storage system 12, according to a preferred embodiment of the present invention. By way of example, a device 23, also herein termed device B6, is assumed to be active in system 12 at time t=2, after initialization time t=0, and some of the stripes initially allocated to an initial set of devices B1, B2, B3, B4, B5, and any data stored therein, are reallocated to device B6. The reallocation is performed using procedure 70 or a modification of procedure 50 (described in more detail below with reference to FIG. 6), preferably according to the procedure that was used at time t=0. As is illustrated in FIG. 5, and as is described below, stripes from devices B1, B2, B3, B4, B5 are substantially evenly removed from the devices and are transferred to device B6. B1, B2, B3, B4, B5, B6 act as an extended set of the initial set.
  • FIG. 6 is a flowchart describing a procedure 90 that is a modification of procedure 50 (FIG. 2), according to an alternative preferred embodiment of the present invention. Apart from the differences described below, procedure 90 is generally similar to procedure 50, so that steps indicated by the same reference numerals in both procedures are generally identical in implementation. As in procedure 50, procedure 90 uses a randomizing function to allocate stripes s to devices Bn in system 12, when a device is added to the system. The allocations determined by procedure 90 are stored in table 32 of memory 28.
  • Assuming procedure 50 is applied at t=2, at step 52 the total number of active devices Td=6, and identifying integers for each active device Bn are assumed to be 1 for B1, 2 for B2, 3 for B3, 4 for B4, 5 for B5, 6 for B6. In a step 91 CPU 26 determines a random integer between 1 and 6.
  • In a step 92, the CPU determines if the random number corresponds to one of the devices present at time t=0. If it does correspond, then CPU 26 returns to the beginning of procedure 90 by incrementing stripe s, via step 58, and no reallocation of stripe s is made. If it does not correspond, i.e., the random number is 6, corresponding to device B6, the stripe is reallocated to device B6 step 56, the reallocated location is stored in table 32. Procedure 90 then continues to step 58. Table III below illustrates the results of applying procedure 90 to the allocation of stripes given in Table II.
    TABLE III
    Random
    Device Bs Number R Device Bs
    Stripe s t = 0 t = 2 t = 2
      1 B3 6 B6
      2 B5 4 B5
    . . . . . . . . . . . .
    6058 B2 5 B2
    6059 B2 3 B2
    6060 B4 5 B4
    6061 B5 6 B6
    6062 B3 3 B5
    6063 B5 1 B5
    6064 B1 3 B1
    6065 B3 1 B2
    6066 B2 6 B6
    6067 B3 4 B5
    6068 B1 5 B1
    6069 B2 2 B2
    6070 B4 1 B4
    6071 B5 5 B5
    6072 B4 2 B4
    6073 B1 4 B1
    6074 B5 5 B5
    6075 B3 1 B4
    6076 B1 3 B1
    6077 B2 6 B6
    6078 B4 1 B4
    . . . . . . . . . . . .
  • It will be appreciated that procedure 90 only generates transfer of stripes, and thus reallocation of data, to device B6. The procedure reallocates the stripes to B6 by transferring stripes, substantially evenly, from devices B1, B2, B3, B4, B5 of the system, and no transfer of stripes, or data stored therein, occurs in system 12 other than stripes/data transferred to B6. Any such data transfer may be made directly to device B6, without use of an intermediate device Bn.
  • It will also be appreciated that procedure 70 may be applied when device B6 is added to system 12. Consideration of procedure 70 shows that similar results to those of procedure 90 apply, i.e., that there is only reallocation of stripes, and data stored therein, to device B6. As for procedure 90, procedure 70 generates substantially even reallocation of stripes/data from the other devices of the system.
  • FIG. 7 is a schematic diagram which illustrates a fully mirrored distribution of data D in storage system 12 (FIG. 1), and FIG. 8 is a flowchart illustrating a procedure 100 for performing the distribution, according to preferred embodiments of the present invention. Procedure 100 allocates each specific stripe to a primary device Bn1, and a copy of the specific stripe to a secondary device Bn2, n1≠tn2, so that each stripe is mirrored. To implement the mirrored distribution, in a first step 102 of procedure 100, CPU 26 determines primary device Bn1 for locating a stripe using procedure 50 or procedure 70. In a second step 104, CPU 26 determines secondary device Bn2 for the stripe using procedure 50 or procedure 70, assuming that device Bn1 is not available. In a third step 106, CPU 26 allocates copies of the strip to devices Bn1 and Bn2, and writes the device identifies to a table 34 in memory 28, for future reference. CPU 26 implements procedure 100 for all stripes 36 in devices Bn.
  • Table IV below illustrates devices Bn1 and Bn2 determined for stripes 6058-6078 of Table I, where procedure 50.
    TABLE IV
    Stripe Device Bn1 Device Bn2
    6058 B2 B4
    6059 B2 B5
    6060 B4 B2
    6061 B5 B4
    6062 B3 B1
    6063 B5 B4
    6064 B1 B3
    6065 B3 B4
    6066 B2 B5
    6067 B3 B1
    6068 B1 B3
    6069 B2 B5
    6070 B4 B1
    6071 B5 B3
    6072 B4 B2
    6073 B1 B3
    6074 B5 B1
    6075 B3 B5
    6076 B1 B3
    6077 B2 B4
    6078 B4 B1
  • If any specific device Bn becomes unavailable, so that only one copy of the stripes on the device is available in system 12, CPU 26 may implement a procedure similar to procedure 100 to generate a new second copy of the stripes that were on the unavailable device. For example, if after allocating stripes 6058-6078 according to Table IV, device B3 becomes unavailable, copies of stripes 6062, 6065, 6067, and 6075, need to be allocated to new devices in system 12 to maintain full mirroring. Procedure 100 may be modified to find the new device of each stripe by assuming that the remaining device, as well as device B3, is unavailable. Thus, for stripe 6062, CPU 26 assumes that devices B1 and B3 are unavailable, and determines that instead of device B3 the stripe should be written to device B4. Table V below shows the devices that the modified procedure 100 determines for stripes 6058, 6060, 6062, 6065, 6072, and 6078, when B3 becomes unavailable.
    TABLE V
    Stripe s Device Bn1 Device Bn2
    6062 B1 B2
    6065 B4 B5
    6067 B1 B4
    6075 B5 B2
  • It will be appreciated that procedure 100 spreads locations for stripes 36 substantially evenly across all devices Bn, while ensuring that each pair of copies of any particular stripe are on different devices, as is illustrated in FIG. 7. Furthermore, the even distribution of locations is maintained even when one of devices Bn, becomes unavailable. Either copy, or both copies, of any particular stripe may be used when host 24 communicates with system 12. It will also be appreciated that in the event of one of devices Bn becoming unavailable, procedure 100 regenerates secondary locations for copies of stripes 36 that are evenly distributed over devices Bn.
  • Referring back to FIG. 1, it will be understood that the sizes of tables 30, 32, or 34 are a function of the number of stripes in system 12, as well as the number of storage devices in the system. Some preferred embodiments of the present invention reduce the sizes of tables 30, 32, or 34 by duplicating some of the entries of the tables, by relating different stripes mathematically. For example, if system 12 comprises 2,000,000 stripes, the same distribution may apply to every 500,000 stripes, as illustrated in Table VI below. Table VI is derived from Table I.
    TABLE VI
    Stripe s Stripe s Stripe s Stripe s Device B s
      1 500,001 1,000,001 1,500,001 B 3
      2 500,002 1,000,002 1,500,002 B5
    . . . . . . . . . . . . . . .
    6059 506,059 1,006,059 1,506,059 B2
    6060 506,060 1,006,060 1,506,060 B4
    . . . . . . . . . . . . . . .
  • It will be appreciated that procedures such as those described above may be applied substantially independently to different storage devices, or types of devices, of a storage system. For example, a storage system may comprise a distributed fast access cache coupled to a distributed slow access mass storage. Such a storage system is described in more detail in the U.S. Application titled “Distributed Independent Cache Memory,” filed on even date, and assigned to the assignee of the present invention. The fast access cache may be assigned addresses according to procedure 50 or modifications of procedure 50, while the slow access mass storage may be assigned addresses according to procedure 70 or modifications of procedure 70.
  • It will thus be appreciated that the preferred embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.

Claims (20)

1. A method for distributing data, comprising:
distributing logical addresses among an initial set of storage devices so as provide a balanced access to the devices;
transferring the data to the storage devices in accordance with the logical addresses;
removing a surplus device from the initial set, thus forming a depleted set of the storage devices comprising the initial storage devices less the surplus storage device; and
redistributing the logical addresses among the storage devices in the depleted set so as to cause logical addresses of the surplus device to be transferred to the depleted set, while maintaining the balanced access and without requiring a substantial transfer of logical addresses among the storage devices in the depleted set.
2. A method according to claim 1, wherein redistributing the logical addresses comprises no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
3. A method according to claim 1, wherein distributing the logical addresses comprises applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and wherein redistributing the logical addresses comprises applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
4. A method according to claim 1, wherein distributing the logical addresses comprises applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and wherein redistributing the logical addresses comprises applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
5. A method according to claim 1, wherein at least one of the storage devices comprises a fast access time memory.
6. A method according to claim 1, wherein at least one of the storage devices comprises a slow access time mass storage device.
7. A method according to claim 1, wherein the storage devices have substantially equal capacities, and wherein distributing the logical addresses comprises distributing the logical addresses substantially evenly among the initial set, and wherein redistributing the logical addresses comprises redistributing the logical addresses substantially evenly among the depleted set.
8. A method according to claim 1, wherein a first storage device comprised in the storage devices has a first capacity different from a second capacity of a second storage device comprised in the storage devices, and wherein distributing the logical addresses comprises distributing the logical addresses substantially according to a ratio of the first capacity to the second capacity, and wherein redistributing the logical addresses comprises redistributing the logical addresses substantially according to the ratio.
9. A method according to claim 1, wherein distributing the logical addresses comprises allocating a specific logical address to a first storage device and to a second storage device, the first and second storage devices comprising different storage devices, and wherein storing the data comprises storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
10. A method according to claim 1, and comprising writing the data from a host external to the storage devices, and reading the data to the external host from the storage devices.
11. A data distribution system, comprising:
an initial set of storage devices among which are distributed logical addresses so as provide a balanced access to the devices, and wherein data is stored in accordance with the logical addresses; and
a depleted set of storage devices, formed by subtracting a surplus storage device from the initial set, the logical addresses being redistributed among the storage devices in the depleted set so as to cause logical addresses of the surplus device to be transferred to the depleted set, while maintaining the balanced access and without requiring a substantial transfer of the logical addresses among the storage devices in the depleted set.
12. A system according to claim 11, wherein redistributing the logical addresses comprises no transfer of the logical addresses to the storage devices in the depleted set apart from the logical addresses of the surplus device.
13. A system according to claim 11, wherein the distributed logical addresses are determined by applying a consistent hashing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and wherein redistributing the logical addresses comprises applying the consistent hashing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
14. A system according to claim 11, wherein the distributed logical addresses are determined by applying a randomizing function to the initial set of storage devices so as to determine respective initial locations of the logical addresses among the initial set, and wherein redistributing the logical addresses comprises applying the randomizing function to the depleted set of storage devices so as to determine respective subsequent locations of the logical addresses among the depleted set.
15. A system according to claim 11, wherein at least one of the storage devices comprises a fast access time memory.
16. A system according to claim 11, wherein at least one of the storage devices comprises a slow access time mass storage device.
17. A system according to claim 11, wherein the storage devices have substantially equal capacities, and wherein the distributed logical addresses are distributed substantially evenly among the initial set, and wherein redistributing the logical addresses comprises redistributing the logical addresses substantially evenly among the depleted set.
18. A system according to claim 11, wherein a first storage device comprised in the storage devices has a first capacity different from a second capacity of a second storage device comprised in the storage devices, and wherein the distributed logical addresses are distributed substantially according to a ratio of the first capacity to the second capacity, and wherein redistributing the logical addresses comprises redistributing the logical addresses substantially according to the ratio.
19. A system according to claim 11, wherein the distributed logical addresses comprise a specific logical address allocated to a first storage device and a second storage device, the first and second storage devices comprising different storage devices, and wherein storing the data comprises storing a first copy of the data on the first storage device and a second copy of the data on the second storage device.
20. A system according to claim 11, and comprising a memory having a table wherein is stored a correspondence between a plurality of logical addresses and a specific storage device in the initial set, wherein the plurality of logical addresses are related to each other by a mathematical relation.
US11/345,781 2003-07-15 2006-02-02 Data allocation in a distributed storage system Abandoned US20060129738A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/345,781 US20060129738A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/620,080 US7908413B2 (en) 2003-07-15 2003-07-15 Data allocation in a distributed storage system
US11/345,781 US20060129738A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/620,080 Division US7908413B2 (en) 2003-07-15 2003-07-15 Data allocation in a distributed storage system

Publications (1)

Publication Number Publication Date
US20060129738A1 true US20060129738A1 (en) 2006-06-15

Family

ID=33477086

Family Applications (6)

Application Number Title Priority Date Filing Date
US10/620,080 Active 2029-04-08 US7908413B2 (en) 2003-07-15 2003-07-15 Data allocation in a distributed storage system
US11/346,409 Abandoned US20060129783A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system
US11/345,781 Abandoned US20060129738A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system
US11/345,778 Abandoned US20060129737A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system
US13/020,043 Expired - Fee Related US8112553B2 (en) 2003-07-15 2011-02-03 Data allocation in a distributed storage system
US13/326,536 Expired - Fee Related US8452899B2 (en) 2003-07-15 2011-12-15 Data allocation in a distributed storage system

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US10/620,080 Active 2029-04-08 US7908413B2 (en) 2003-07-15 2003-07-15 Data allocation in a distributed storage system
US11/346,409 Abandoned US20060129783A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system

Family Applications After (3)

Application Number Title Priority Date Filing Date
US11/345,778 Abandoned US20060129737A1 (en) 2003-07-15 2006-02-02 Data allocation in a distributed storage system
US13/020,043 Expired - Fee Related US8112553B2 (en) 2003-07-15 2011-02-03 Data allocation in a distributed storage system
US13/326,536 Expired - Fee Related US8452899B2 (en) 2003-07-15 2011-12-15 Data allocation in a distributed storage system

Country Status (2)

Country Link
US (6) US7908413B2 (en)
EP (1) EP1498831B1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090172139A1 (en) * 2007-12-26 2009-07-02 Kai Chiu Wong Balanced consistent hashing for distributed resource management
US7945640B1 (en) * 2007-09-27 2011-05-17 Emc Corporation Methods and apparatus for network provisioning
US9009424B2 (en) 2012-10-29 2015-04-14 International Business Machines Corporation Data placement for loss protection in a storage system

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4068473B2 (en) * 2003-02-19 2008-03-26 株式会社東芝 Storage device, assignment range determination method and program
US7277993B2 (en) * 2003-12-03 2007-10-02 Intel Corporation Write-back disk cache
US7558911B2 (en) * 2003-12-18 2009-07-07 Intel Corporation Maintaining disk cache coherency in multiple operating system environment
US8307174B1 (en) * 2004-06-25 2012-11-06 Emc Corporation System and method for managing sessions and reallocating memory resources used for replication of data in a data storage environment
US20060123232A1 (en) * 2004-12-08 2006-06-08 International Business Machines Corporation Method for protecting and managing retention of data on worm media
US7979613B2 (en) * 2005-07-15 2011-07-12 International Business Machines Corporation Performance of a storage system
US10169229B2 (en) * 2012-06-05 2019-01-01 International Business Machines Corporation Protocols for expanding existing sites in a dispersed storage network
US8776052B2 (en) * 2007-02-16 2014-07-08 International Business Machines Corporation Method, an apparatus and a system for managing a distributed compression system
US20110238874A1 (en) * 2007-08-01 2011-09-29 International Business Machines Corporation Performance of a storage system
US8386744B2 (en) 2007-10-01 2013-02-26 International Business Machines Corporation Thin provisioning migration and scrubbing
US8032637B2 (en) * 2007-12-26 2011-10-04 Symantec Corporation Balanced consistent hashing for distributed resource management
US8499120B2 (en) * 2008-10-17 2013-07-30 Seagate Technology Llc User selectable caching management
WO2011079467A1 (en) * 2009-12-31 2011-07-07 华为技术有限公司 Method, device and system for scheduling distributed buffer resources
JP5533252B2 (en) * 2010-05-21 2014-06-25 富士通株式会社 Disk array device and disk array device control method
EP2605143A4 (en) * 2010-08-13 2014-10-08 Fujitsu Ltd Memory control device, information processing device, and control method for a memory control device
US8564603B2 (en) * 2010-10-24 2013-10-22 Himax Technologies Limited Apparatus for controlling memory device and related method
GB201108638D0 (en) * 2011-05-24 2011-07-06 Acunu Ltd A method of assigning logical data regions to multiple disks so as to improve sequential data access
US9875094B2 (en) 2012-08-29 2018-01-23 International Business Machines Corporation Microcode upgrade in a storage system
JP6142599B2 (en) * 2013-03-18 2017-06-07 富士通株式会社 Storage system, storage device and control program
US9405635B2 (en) * 2013-04-16 2016-08-02 Commvault Systems, Inc. Multi-source restore in an information management system
US9116630B2 (en) * 2013-08-30 2015-08-25 Nimble Storage, Inc. Method and system for migrating data between storage devices of a storage array
JP6301802B2 (en) * 2014-10-03 2018-03-28 デクセリアルズ株式会社 Water purification agent and water purification method
US10152383B2 (en) * 2014-12-17 2018-12-11 Airwatch Llc Expedited device backup, wipe, and enrollment
JP2018522730A (en) * 2015-07-13 2018-08-16 レゾン インヴェストメンツ インコーポレイテッドＲａｉｓｏｎ Ｉｎｖｅｓｔｍｅｎｔｓ Ｉｎｃ． Magnetic mixing equipment
CN111414198B (en) * 2020-03-18 2023-05-02 北京字节跳动网络技术有限公司 Request processing method and device
CN111459893B (en) * 2020-04-03 2023-08-22 北京字节跳动网络技术有限公司 File processing method and device and electronic equipment
CN112486411B (en) * 2020-11-25 2022-08-02 湖南麒麟信安科技股份有限公司 Method, device and medium for distributing disks of distributed file system in super-fusion environment
US11271865B1 (en) 2020-12-02 2022-03-08 Microsoft Technology Licensing, Llc Resource popularity assessment and utilization

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5390327A (en) * 1993-06-29 1995-02-14 Digital Equipment Corporation Method for on-line reorganization of the data on a RAID-4 or RAID-5 array in the absence of one disk and the on-line restoration of a replacement disk
US5392244A (en) * 1993-08-19 1995-02-21 Hewlett-Packard Company Memory systems with data storage redundancy management
US5519844A (en) * 1990-11-09 1996-05-21 Emc Corporation Logical partitioning of a redundant array storage system
US5615352A (en) * 1994-10-05 1997-03-25 Hewlett-Packard Company Methods for adding storage disks to a hierarchic disk array while maintaining data availability
US5875481A (en) * 1997-01-30 1999-02-23 International Business Machines Corporation Dynamic reconfiguration of data storage devices to balance recycle throughput
US6061732A (en) * 1997-05-26 2000-05-09 U. S. Philips Corporation Data streaming system utilizing an asynchronous technique for retrieving data from a stream server
US6317815B1 (en) * 1997-12-30 2001-11-13 Emc Corporation Method and apparatus for formatting data in a storage device
US6332177B1 (en) * 1998-10-19 2001-12-18 Lsi Logic Corporation N-way raid 1 on M drives block mapping
US6434666B1 (en) * 1995-02-20 2002-08-13 Hitachi, Ltd. Memory control apparatus and method for storing data in a selected cache memory based on whether a group or slot number is odd or even
US6453404B1 (en) * 1999-05-27 2002-09-17 Microsoft Corporation Distributed data cache with memory allocation model
US20020156892A1 (en) * 1998-03-13 2002-10-24 Massachusetts Institute Of Technology Method and apparatus for distributing requests among a plurality of resources
US20020162047A1 (en) * 1997-12-24 2002-10-31 Peters Eric C. Computer system and process for transferring streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US20040003173A1 (en) * 2002-01-25 2004-01-01 Yao Shu-Yuen Didi Pseudorandom data storage

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6425059B1 (en) * 1999-12-11 2002-07-23 International Business Machines Corporation Data storage library with library-local regulation of access to shared read/write drives among multiple hosts
US7181578B1 (en) * 2002-09-12 2007-02-20 Copan Systems, Inc. Method and apparatus for efficient scalable storage management
US7003628B1 (en) * 2002-12-27 2006-02-21 Unisys Corporation Buffered transfer of data blocks between memory and processors independent of the order of allocation of locations in the buffer

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5519844A (en) * 1990-11-09 1996-05-21 Emc Corporation Logical partitioning of a redundant array storage system
US5390327A (en) * 1993-06-29 1995-02-14 Digital Equipment Corporation Method for on-line reorganization of the data on a RAID-4 or RAID-5 array in the absence of one disk and the on-line restoration of a replacement disk
US5392244A (en) * 1993-08-19 1995-02-21 Hewlett-Packard Company Memory systems with data storage redundancy management
US5615352A (en) * 1994-10-05 1997-03-25 Hewlett-Packard Company Methods for adding storage disks to a hierarchic disk array while maintaining data availability
US6434666B1 (en) * 1995-02-20 2002-08-13 Hitachi, Ltd. Memory control apparatus and method for storing data in a selected cache memory based on whether a group or slot number is odd or even
US5875481A (en) * 1997-01-30 1999-02-23 International Business Machines Corporation Dynamic reconfiguration of data storage devices to balance recycle throughput
US6061732A (en) * 1997-05-26 2000-05-09 U. S. Philips Corporation Data streaming system utilizing an asynchronous technique for retrieving data from a stream server
US20020162047A1 (en) * 1997-12-24 2002-10-31 Peters Eric C. Computer system and process for transferring streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US6317815B1 (en) * 1997-12-30 2001-11-13 Emc Corporation Method and apparatus for formatting data in a storage device
US20020156892A1 (en) * 1998-03-13 2002-10-24 Massachusetts Institute Of Technology Method and apparatus for distributing requests among a plurality of resources
US6332177B1 (en) * 1998-10-19 2001-12-18 Lsi Logic Corporation N-way raid 1 on M drives block mapping
US6453404B1 (en) * 1999-05-27 2002-09-17 Microsoft Corporation Distributed data cache with memory allocation model
US20040003173A1 (en) * 2002-01-25 2004-01-01 Yao Shu-Yuen Didi Pseudorandom data storage
US7096328B2 (en) * 2002-01-25 2006-08-22 University Of Southern California Pseudorandom data storage

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7945640B1 (en) * 2007-09-27 2011-05-17 Emc Corporation Methods and apparatus for network provisioning
US20090172139A1 (en) * 2007-12-26 2009-07-02 Kai Chiu Wong Balanced consistent hashing for distributed resource management
CN101960427A (en) * 2007-12-26 2011-01-26 斯曼泰克公司 The balance consistance hash of distributed resource management
US8244846B2 (en) * 2007-12-26 2012-08-14 Symantec Corporation Balanced consistent hashing for distributed resource management
US9009424B2 (en) 2012-10-29 2015-04-14 International Business Machines Corporation Data placement for loss protection in a storage system
US9389963B2 (en) 2012-10-29 2016-07-12 International Business Machines Corporation Data placement for loss protection in a storage system
US9798618B2 (en) 2012-10-29 2017-10-24 International Business Machines Corporation Data placement for loss protection in a storage system

Also Published As

Publication number Publication date
US20060129783A1 (en) 2006-06-15
US7908413B2 (en) 2011-03-15
US20120089802A1 (en) 2012-04-12
US20060129737A1 (en) 2006-06-15
US20050015566A1 (en) 2005-01-20
EP1498831A2 (en) 2005-01-19
EP1498831B1 (en) 2014-12-24
US8112553B2 (en) 2012-02-07
EP1498831A3 (en) 2006-06-21
US8452899B2 (en) 2013-05-28
US20110138150A1 (en) 2011-06-09

Similar Documents

Publication Publication Date Title
US8452899B2 (en) Data allocation in a distributed storage system
US7779224B2 (en) Data storage system
US10558383B2 (en) Storage system
US20060107097A1 (en) Data protection in a mass storage system
US5555404A (en) Continuously available database server having multiple groups of nodes with minimum intersecting sets of database fragment replicas
US6728832B2 (en) Distribution of I/O requests across multiple disk units
KR100490723B1 (en) Apparatus and method for file-level striping
US20080168209A1 (en) Data protection via software configuration of multiple disk drives
US8543761B2 (en) Zero rebuild extensions for raid
JP2006120118A (en) Metadata for grid base data storage system
US12099412B2 (en) Storage system spanning multiple failure domains
US11188258B2 (en) Distributed storage system
CN106656631A (en) Method and system of logical volume dynamic allocation on shared storage
EP1498818B1 (en) Address distribution among independent cache memories
US7827353B2 (en) Self healing memory
CN112256204B (en) Storage resource allocation method and device, storage node and storage medium
US11150991B2 (en) Dynamically adjusting redundancy levels of storage stripes
US20080168224A1 (en) Data protection via software configuration of multiple disk drives
CN108228079B (en) Storage management method and device
CN117234811B (en) Data backup method, device, equipment and storage medium
WO2004036424A2 (en) Efficient expansion of highly reliable storage arrays and clusters

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION