Managing distributed system performance using accelerated data retrieval operations

• US 9,612,906 B1
• Filed: 05/24/2016
• Issued: 04/04/2017
• Est. Priority Date: 02/08/2013
• Status: Active Grant

• Current Assignee: Quantcast
• Original Assignee: Quantcast
• Inventors: Molina-Estolano, Esteban, Rus, Silvius V.
• Primary Examiner(s): Etienne, Ario
• Assistant Examiner(s): HURST, ANDREA L
• Application Number:
  US15/163,387
• Time in Patent Office: 315 Days
• 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 method for managing performance of a distributed storage system, the method comprising:

storing, in a plurality of storage devices of the distributed storage system, 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 reconstruct the data item, and wherein the plurality of stripes includes redundancy information for the data item;

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

responsive to determining that a processing speed associated with the task does not meet a threshold, performing an accelerated data retrieval operation by;

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

determining whether at least the minimum number of stripes required to reconstruct the data item has been received; and

responsive to a determination that at least the minimum number of stripes required to reconstruct the data item has been received, reconstructing the data item using redundancy information.

2. The 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 method of claim 1 wherein:

each stripe in the plurality of stripes comprises redundancy information for the data item.

4. The method of claim 1 wherein:

the plurality of stripes comprises at least one redundancy stripe.

5. The method of claim 1 wherein:

the stripes of the plurality of stripes are each stored on a different storage device of the distributed storage system.

6. The 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 system, 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 system.

7. The method of claim 1 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time, an average processing speed of the plurality of additional tasks comprising a sum of the processing speeds of the additional tasks divided by the number of additional tasks; and

the threshold comprises the average processing speed of the plurality of additional tasks.

8. The method of claim 1 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time, an average processing speed of the plurality of additional tasks comprising a sum of the processing speeds of the additional tasks divided by the number of additional tasks; and

the threshold comprises a fraction of the average processing speed of the plurality of additional tasks.

9. The method of claim 1 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time; and

the threshold comprises a selected additional task'"'"'s processing speed, the selected additional task selected for having a slowest processing speed of the plurality of additional tasks.

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

storing, in a plurality of storage devices of the distributed storage system, 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 reconstruct the data item, and wherein the plurality of stripes includes redundancy information for the data item;

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

responsive to determining that a processing speed associated with the task does not meet a threshold, performing an accelerated data retrieval operation by;

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

determining whether at least the minimum number of stripes required to reconstruct the data item has been received; and

responsive to a determination that at least the minimum number of stripes required to reconstruct the data item has been received, reconstructing the data item using redundancy information.

11. The medium of claim 10 wherein:

the plurality of stripes associated with the data item is generated according to an error correction coding scheme.

12. The medium of claim 10 wherein:

each stripe in the plurality of stripes comprises redundancy information for the data item.

13. The medium of claim 10 wherein:

the plurality of stripes comprises at least one redundancy stripe.

14. The medium of claim 10 wherein:

the stripes of the plurality of stripes are each stored on a different storage device of the distributed storage system.

15. The medium of claim 10 wherein the instructions further comprise instructions for:

storing a plurality of copies of the plurality of stripes associated with the data item in the distributed storage system, 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 system.

16. The medium of claim 10 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time, an average processing speed of the plurality of additional tasks comprising a sum of the processing speeds of the additional tasks divided by the number of additional tasks; and

the threshold comprises the average processing speed of the plurality of additional tasks.

17. The medium of claim 10 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time, an average processing speed of the plurality of additional tasks comprising a sum of the processing speeds of the additional tasks divided by the number of additional tasks; and

the threshold comprises a fraction of the average processing speed of the plurality of additional tasks.

18. The medium of claim 10 wherein:

the distributed process comprises a plurality of additional tasks, each of the plurality of additional tasks having a respective processing speed, each respective processing speed comprising an amount of data processed by the respective additional task divided by the pre-defined time; and

the threshold comprises a selected additional task'"'"'s processing speed, the selected additional task selected for having a slowest processing speed of the plurality of additional tasks.

19. A system comprising:

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

storing, in a plurality of storage devices of the distributed storage system, 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 reconstruct the data item, and wherein the plurality of stripes includes redundancy information for the data item;

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

responsive to determining that a processing speed associated with the task does not meet a threshold, performing an accelerated data retrieval operation by;

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

determining whether at least the minimum number of stripes required to reconstruct the data item has been received; and

responsive to a determination that at least the minimum number of stripes required to reconstruct the data item has been received, reconstructing the data item using redundancy information.

20. The system of claim 19 wherein:

the plurality of stripes associated with the data item is generated according to an error correction coding scheme.