Managing distributed system performance using accelerated data retrieval operations

• US 9,444,889 B1
• Filed: 02/08/2013
• Issued: 09/13/2016
• Est. Priority Date: 02/08/2013
• Status: Active Grant

• Current Assignee: Quantcast
• Original Assignee: Quantcast
• Inventors: Rus, Silvius V., Molina-Estolano, Esteban
• Primary Examiner(s): Meky, Moustafa M
• Assistant Examiner(s): HURST, ANDREA L
• Application Number:
  US13/763,459
• Time in Patent Office: 1,313 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 11/1088 Reconstruction on already foreseen single or plurality of spare disks
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0647 Migration mechanisms
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

A distributed system is adapted to manage the performance of distributed processes. In one aspect, multiple stripes associated with a data item are stored in a distributed storage. The stored stripes include one or more stripes of redundancy information for the data item. A distributed process including at least one task is performed. During performance of the distributed process, a determination is made as to whether to perform an accelerated data retrieval operation. Responsive to a determination to perform an accelerated data retrieval operation, at least one of the one or more stripes of redundancy information for the data item is requested from the distributed storage. Other stripes associated with the data item may also be requested from the distributed storage. After a sufficient subset of stripes associated with the data item is received, the data item is reconstructed using the subset.

Claims

1. A computer-implemented method for managing performance of a distributed system, the method comprising:

storing, in a plurality of storage devices of a distributed storage, a plurality of stripes associated with a data item, the plurality of stripes generated according to a coding scheme, wherein the coding scheme generates a number of stripes associated with the data item that is more than a minimum number of stripes needed to assemble the data item, and wherein the plurality of stripes includes at least one redundancy stripe;

performing a distributed process including a task that requires retrieval of the data item from the distributed storage;

determining a processing speed associated with the task; and

responsive to determining the processing speed does not meet a threshold, performing an accelerated data retrieval operation by

requesting more than the minimum number of stripes needed to assemble the data item from at least two of the plurality of storage devices of the distributed storage;

receiving at least the minimum number of stripes; and

reconstructing the data item from the minimum number of stripes according to the coding scheme.

2. The computer-implemented method of claim 1, wherein the plurality of stripes associated with the data item is generated according to an error correction coding scheme.

3. The computer-implemented method of claim 1, wherein the stripes of the plurality of stripes are each stored on a different storage device of the distributed storage.

4. The computer-implemented method of claim 1 further comprising:

storing a plurality of copies of the plurality of stripes associated with the data item in the distributed storage, and wherein performing the accelerated data retrieval operation further comprises requesting the plurality of copies of the plurality of stripes associated with the data item from the distributed storage.

5. The computer-implemented method of claim 1, wherein performing the accelerated data retrieval operation comprises:

determining whether a sufficient subset of the stripes associated with the data item has been received to reconstruct the data item; and

responsive to a determination that a sufficient subset has been received, reconstructing the data item using the subset.

6. A non-transitory computer readable storage medium executing computer program instructions for managing performance of a distributed system, the computer program instructions comprising instructions for:

storing, in a plurality of storage devices of a distributed storage, a plurality of stripes associated with a data item, the plurality of stripes generated according to a coding scheme, wherein the coding scheme generates a number of stripes associated with the data item that is more than a minimum number of stripes needed to assemble the data item, and wherein the plurality of stripes includes at least one redundancy stripe;

performing a distributed process including a task that requires retrieval of the data item from the distributed storage;

determining a processing speed associated with the task; and

responsive to determining the processing speed does not meet a threshold, performing an accelerated data retrieval operation by

requesting more than the minimum number of stripes needed to assemble the data item from at least two of the plurality of storage devices of the distributed storage;

receiving at least the minimum number of stripes; and

reconstructing the data item from the minimum number of stripes according to the coding scheme.

7. The medium of claim 6, wherein the plurality of stripes associated with the data item is generated according to an error correction coding scheme.

8. The medium of claim 6, wherein the instructions for performing the accelerated data retrieval operation comprise instructions for:

determining whether a sufficient subset of the stripes associated with the data item has been received to reconstruct the data item; and

responsive to a determination that a sufficient subset has been received, reconstructing the data item using the subset.

9. A system comprising:

a computer readable storage medium storing processor-executable computer program instructions for managing performance of a distributed system, the instructions comprising instructions for;

storing, in a plurality of storage devices of a distributed storage, a plurality of stripes associated with a data item, the plurality of stripes generated according to a coding scheme, wherein the coding scheme generates a number of stripes associated with the data item that is more than a minimum number of stripes needed to assemble the data item, and wherein the plurality of stripes includes at least one redundancy stripe;

performing a distributed process including a task that requires retrieval of the data item from the distributed storage;

determining a processing speed associated with the task; and

responsive to determining the processing speed does not meet a threshold, performing an accelerated data retrieval operation by

requesting more than the minimum number of stripes needed to assemble the data item from at least two of the plurality of storage devices of the distributed storage;

receiving at least the minimum number of stripes; and

reconstructing the data item from the minimum number of stripes according to the coding scheme; and

a processor for executing the computer program instructions.

10. The system of claim 9, wherein the plurality of stripes associated with the data item is generated according to an error correction coding scheme.

11. The system of claim 9, wherein the instructions for performing the accelerated data retrieval operation comprise instructions for:

determining whether a sufficient subset of the stripes associated with the data item has been received to reconstruct the data item; and

responsive to a determination that a sufficient subset has been received, reconstructing the data item using the subset.