DISPERSED STORAGE WITH COORDINATED EXECUTION AND METHODS FOR USE THEREWITH

• US 20150067164A1
• Filed: 06/26/2014
• Published: 03/05/2015
• Est. Priority Date: 08/29/2013
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: Cleversafe Incorporated (International Business Machines Corporation)
• Inventors: Kazi, Asimuddin, Resch, Jason K.
• Granted Patent: US 9,998,538 B2
• Time in Patent Office: Days
• US Class Current: 709/225
• 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/1096 Parity calculation or recalculation after configuration or reconfiguration of the system
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 2211/1028 Distributed, i.e. distributed RAID systems with parity
• CPC Class Codes: G11C 2029/4402 Internal storage of test result, quality data, chip identification, repair information
• CPC Class Codes: G11C 29/44 Indication or identification of errors, e.g. for repair
• 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]
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70

Abstract

A dispersed storage and task (DST) processing unit receives an access request. An estimated processing load, associated with the access request, is determined. A processing resource is selected based on the estimated processing load. A coordinated execution schedule is determined for a plurality of DST execution units. The access request is assigned to the processing resource in accordance with the coordinated execution schedule.

Claims

1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage and task (DST) network, the method comprises:

receiving an access request;

determining an estimated processing load associated with the access request;

selecting a processing resource based on the estimated processing load;

determining a coordinated execution schedule for a plurality of DST execution units; and

assigning the access request to the processing resource in accordance with the coordinated execution schedule.

2. The method of claim 1 further comprising:

detecting an execution deviation in the coordinated execution schedule; and

updating the coordinated execution schedule in response to the execution deviation.

3. The method of claim 1 wherein the estimated processing load is determined based on at least one of:

an access type corresponding to the access request, or a quantity of data slices associated with the access request.

4. The method of claim 1 wherein the processing resource is selected from a plurality of processing resources, based on a capability of the processing resource.

5. The method of claim 1 wherein the coordinated execution schedule is determined based on at least one of:

an execution status associated with one or more current access requests, or a number of access requests in queue.

6. The method of claim 1 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units.

7. The method of claim 1 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units based on an estimated completion time of one or more prior access requests.

8. A dispersed storage and task (DST) processing unit comprises:

at least one module, when operable within a computing device, that causes the computing device to;

receive an access request;

determine an estimated processing load associated with the access request;

select a processing resource based on the estimated processing load;

determine a coordinated execution schedule for a plurality of DST execution units; and

assign the access request to the processing resource in accordance with the coordinated execution schedule.

9. The DST processing unit of claim 8 wherein the at least one module, when operable within the computing device, further causes the computing device to:

detect an execution deviation in the coordinated execution schedule; and

update the coordinated execution schedule in response to the execution deviation.

10. The DST processing unit of claim 8 wherein the estimated processing load is determined based on at least one of:

an access type corresponding to the access request, or a quantity of data slices associated with the access request.

11. The DST processing unit of claim 8 wherein the processing resource is selected from a plurality of processing resources, based on a capability of the processing resource.

12. The DST processing unit of claim 8 wherein the coordinated execution schedule is determined based on at least one of:

an execution status associated with one or more current access requests, or a number of access requests in queue.

13. The DST processing unit of claim 8 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units.

14. The DST processing unit of claim 8 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units based on an estimated completion time of one or more prior access requests.

15. A computer readable storage medium comprises:

at least one memory section that stores operational instructions that, when executed by one or more processing modules of one or more computing devices of a dispersed storage and task (DST) network, causes the one or more computing devices to;

receive an access request;

determine an estimated processing load associated with the access request;

select a processing resource based on the estimated processing load;

determine a coordinated execution schedule for a plurality of DST execution units; and

assign the access request to the processing resource in accordance with the coordinated execution schedule.

16. The DST processing unit of claim 15 wherein the operational instructions, when executed by the one or more processing modules of the one or more computing devices of the dispersed storage network (DSN), further causes the one or more computing devices to:

detect an execution deviation in the coordinated execution schedule; and

update the coordinated execution schedule in response to the execution deviation.

17. The computer readable storage medium of claim 15 wherein the estimated processing load is determined based on at least one of:

an access type corresponding to the access request, or a quantity of data slices associated with the access request.

18. The computer readable storage medium of claim 15 wherein the coordinated execution schedule is determined based on at least one of:

an execution status associated with one or more current access requests, or a number of access requests in queue.

19. The computer readable storage medium of claim 15 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units.

20. The computer readable storage medium of claim 15 wherein the coordinated execution schedule is determined to coordinate commencement of the access request across at least a subset of the plurality of DST execution units based on an estimated completion time of one or more prior access requests.