Granted Patent B2

US 9,569,307 · App. 14/180,149 · Granted Feb 14, 2017

Abstract

Claims (36)

1. A non-transitory computer-readable storage device storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:

accessing erasure codes associated with members of two or more related ranges to be stored in an object store, where the two or more related ranges are associated with a single object;

identifying two or more different storage devices associated with the object store;

identifying two or more different types of storage devices associated with the object store;

establishing a distribution plan to store the erasure codes on the two or more different storage devices so that one of the two or more different storage devices becoming unavailable will cause only one of the related ranges to become unavailable, and so that a first member of the two or more related ranges is stored on a first type of storage device and a second, different member of the two or more related ranges is stored on a second different type of storage device;

causing the erasure codes to be stored by the object store according to the distribution plan;

identifying a first subset of the two or more related ranges that are retrievable from the object store, where the first subset may be less than all of the related ranges;

upon determining that the first subset meets a threshold utility measure;

reducing a redundancy setting associated with the object store;

retrieving selected erasure codes associated with the first subset from the object store; and

selectively reconstructing the first subset from the selected erasure codes.

2. The non-transitory computer-readable storage device of claim 1 , where the two or more different storage devices include disk drives, solid state drives, or tape drives.

3. The non-transitory computer-readable storage device of claim 1 , where the two or more different types of storage devices include a hard disk drive, a solid state drive, or a tape drive.

4. The non-transitory computer-readable storage device of claim 1 , where establishing the distribution plan includes establishing a redundancy policy for the erasure codes.

5. The non-transitory computer-readable storage device of claim 4 , where the redundancy policy is an N/1 policy, N being an integer greater than one.

6. The non-transitory computer-readable storage device of claim 4 , where the redundancy policy is an N/0 policy, N being an integer greater than one.

7. The non-transitory computer-readable storage device of claim 1 , the method comprising:

identifying a second subset of the related ranges that are not able to be retrieved from the object store, and

providing data concerning the second subset.

8. The non-transitory computer-readable storage device of claim 1 , the method comprising:

identifying a number D that describes how many storage devices are in the two or more storage devices, D being an integer;

producing the two or more related ranges, where the number of related ranges is greater than or equal to D, and

producing the erasure codes for the related ranges, where the number of erasure codes is greater than or equal to D.

9. An apparatus, comprising:

a processor;

a memory comprising a non-transitory computer-readable storage medium;

a set of logics that control super block distribution to reduce the impact of a single point of failure in an object store that includes a plurality of storage apparatus; and

an interface that connects the processor, the memory, and the set of logics;

the set of logics comprising:

a first logic that identifies a plurality of distinct subsets of storage apparatus from the plurality of storage apparatus, where members of the plurality of distinct subsets of storage apparatus will be used to store members of a plurality of super blocks associated with an object to be stored in the object store, where a single member of the plurality of super blocks can be stored in a single member of the plurality of storage apparatus, where a single member of the plurality of storage apparatus becoming unavailable will cause only one of the plurality of super blocks to become unavailable;

a second logic that establishes a redundancy policy for erasure codes associated with the object, the redundancy policy being an N/M policy, where N describes the total number of erasure codes associated with a super block, N−M describes the minimum number of the N erasure codes needed to reconstruct the super block, N being greater than M, N and M being integers;

a third logic that controls an object store to store the erasure codes in members of the plurality of storage apparatus as controlled by the redundancy policy; and

a fourth logic that identifies how many of the plurality of super blocks can be reconstructed from the object store and provides data describing how many of the plurality of super blocks can be reconstructed, where the fourth logic selectively retrieves one or more of the super blocks from the object store upon determining that a desired reconstruction utility can be achieved from the one or more super blocks, where the one or more super blocks are less than all the super blocks, where the fourth logic controls the second logic to reduce a redundancy level associated with the redundancy policy.

10. The apparatus of claim 9 , where M is one or where M is zero.

11. The apparatus of claim 9 , where identifying the distinct subsets of storage apparatus includes the first logic considering a user-defined rule, an automated rule, or an input from a user interface.

12. The apparatus of claim 9 , comprising a fifth logic that partitions the object into the plurality of super blocks, where the number of super blocks into which the object is partitioned is determined based, at least in part, on how many storage apparatus are available in the plurality of storage apparatus.

Assignments (12)