IP Library Granted Patent US 10,019,316
Granted Patent B1
US 10,019,316 · App. 15/379,004 · Granted Jul 10, 2018

Managing distributed system performance using accelerated data retrieval operations

Inventors: Esteban Molina-Estolano (Redwood City, CA); Silvius V. Rus (Orinda, CA)
Assignee: Quantcast Corporation
G06F11/1088G06F3/065G06F3/067G06F3/0619
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,019,316
App. No.
15/379,004
Granted
Jul 10, 2018
Kind
B1
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 (64)

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 a plurality of copies of at least one stripe;

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, the requested stripes including at least two copies of at least one stripe;

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.

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.

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 a plurality of copies of at least one stripe;

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, the requested stripes including at least two copies of at least one stripe;

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.

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 a plurality of copies of at least one stripe;

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, the requested stripes including at least two copies of at least one stripe;

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.

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.

Assignments (8)
RELEASE OF SECURITY INTEREST Recorded Jun 21, 2024
From: BANK OF AMERICA, N.A.
To: QUANTCAST CORPORATION
Reel/Frame 067807/0017 →
SECURITY INTEREST Recorded Jun 18, 2024
From: QUANTCAST CORPORATION
To: CRYSTAL FINANCIAL LLC D/B/A SLR CREDIT SOLUTIONS
Reel/Frame 067777/0613 →
SECURITY INTEREST Recorded Dec 5, 2022
From: QUANTCAST CORPORATION
To: VENTURE LENDING & LEASING IX, INC.; WTI FUND X, INC.
Reel/Frame 062066/0265 →
SECURITY INTEREST Recorded Sep 30, 2021
From: QUANTCAST CORPORATION
To: BANK OF AMERICA, N.A., AS AGENT
Reel/Frame 057677/0297 →
RELEASE OF SECURITY INTEREST Recorded Sep 30, 2021
From: WELLS FARGO BANK, NATIONAL ASSOCIATION
To: QUANTCST CORPORATION
Reel/Frame 057678/0832 →
RELEASE OF SECURITY INTEREST Recorded Mar 15, 2021
From: TRIPLEPOINT VENTURE GROWTH BDC CORP.
To: QUANTCAST CORPORATION
Reel/Frame 055599/0282 →
SECURITY INTEREST Recorded May 20, 2020
From: QUANTCAST CORPORATION
To: WELLS FARGO BANK, NATIONAL ASSOCIATION
Reel/Frame 052717/0840 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2017
From: RUS, SILVIUS V; MOLINA-ESTOLANO, ESTEBAN
To: QUANTCAST CORP
Reel/Frame 042480/0941 →
Continuity (3)
Continuation 15163387 · May 24, 2016
Continuation 14038255 · Oct 22, 2013
Continuation 13763459 · Feb 8, 2013