Varying rebuild task priorities

• US 10,289,319 B2
• Filed: 08/31/2016
• Issued: 05/14/2019
• Est. Priority Date: 08/31/2015
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Resch, Jason K.
• Primary Examiner(s): Lamarre, Guy J
• Application Number:
  US15/252,444
• Publication Number:
  US 20170060689A1
• Time in Patent Office: 986 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/1092 Rebuilding, e.g. when physically replacing a failing disk
• CPC Class Codes: G06F 11/3034 where the computing system component is a storage system, e.g. DASD based or network based digital input from or digital output to record carriers G06F3/06; digital recording or reproducing G11B20/18; 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], H04L67/1097
• CPC Class Codes: G06F 11/3409 for performance assessment
• CPC Class Codes: G06F 12/1408 by using cryptography for digital transmission H04L9/00
• CPC Class Codes: G06F 2212/1052 Security improvement
• 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/0622 in relation to access
• CPC Class Codes: G06F 3/0635 by changing the path, e.g. traffic rerouting, path reconfiguration
• CPC Class Codes: G06F 3/0637 Permissions
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/0665 at area level, e.g. provisioning of virtual or logical volumes
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/3761 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
• 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 method begins by determining whether at least one encoded data slice of a corresponding set of encoded data slices associated with a primary storage unit requires rebuilding and includes one or more excess encoded data slices of the set of encoded data slices stored in a secondary storage unit. The method continues by identifying the excess encoded data slices based on scan response messages from the secondary storage units. The method continues by assigning, for each data segment associated with at least one of an encoded data slice requiring rebuilding and an excess encoded data slice, a priority level in accordance with a prioritization scheme. The method continues by facilitating, for each data segment, rebuilding of the encoded data slices requiring rebuilding and deletion of excess encoded data slices requiring deletion in accordance with the assigned priority level of the data segment.

Claims

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

determining, for each data segment of a plurality of data segments stored as a plurality of sets of encoded data slices in one or more of primary storage units and secondary storage units of a DSN, whether at least one encoded data slice of a corresponding set of encoded data slices associated with a primary storage unit requires rebuilding and includes one or more excess encoded data slices of the plurality of sets of encoded data slices stored in the secondary storage units;

identifying the excess encoded data slices based on scan response messages from the secondary storage units;

assigning, for each data segment of the plurality of data segments stored as a plurality of sets of encoded data slices and including, in the plurality of sets of encoded data slices, both an encoded data slice requiring rebuilding and an excess encoded data slice, a priority level in accordance with a prioritization scheme; and

facilitating, for each data segment, rebuilding of the at least one encoded data slice requiring rebuilding and deletion of excess encoded data slices requiring deletion in accordance with the assigned priority level of the data segment.

2. The method of claim 1, wherein the determining comprises:

issuing a scan request to rebuild messages to at least one of each of the primary storage units and secondary storage units for the plurality of data segments, receive scan response rebuilding messages; and

identifying the at least one of an encoded data slice requiring rebuilding based on the scan response rebuilding messages from the primary storage units.

3. The method of claim 2, wherein the identifying the at least one of an encoded data slice requiring rebuilding is based on identifying a missing encoded data slice based on a desired pattern.

4. The method of claim 1 further comprising identifying the excess encoded data slice based on a desired pattern.

5. The method of claim 1, wherein the prioritization scheme comprises:

highest priority for at least one encoded data slice to be rebuilt, one corresponding replacement encoded data slice to be deleted, and at least one excess encoded data slice to be deleted;

next highest priority for at least one encoded data slice to be rebuilt, one corresponding replacement encoded data slice to be deleted;

next lowest priority for at least one encoded data slice to be rebuilt; and

lowest priority for only one or more encoded data slices to be deleted.

6. The method of claim 1 further comprising performing the facilitation on data segments associated with a highest priority first followed by a next highest priority.

7. The method of claim 1, wherein the rebuilding comprises:

issuing read slice request rebuilding messages;

receiving read slice response rebuilding messages;

generating a rebuilt encoded data slice;

issuing a write slice request rebuilding message that includes the rebuilt encoded data slice to the primary storage unit;

receiving a write slice response confirming storage of the rebuilt encoded data slice; and

deleting excess encoded data slices.

8. The method of claim 1, wherein the deletion comprises:

issuing a delete slice request affinity message to a corresponding one of the secondary storage units; and

receiving a delete slice response affinity message confirming deletion of the encoded data slice.

9. A computing device of a group of computing devices of a dispersed storage network (DSN), the computing device comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to;

determine, for each data segment of a plurality of data segments stored as a plurality of sets of encoded data slices in one or more of primary storage units and secondary storage units of a DSN, whether at least one encoded data slice of a corresponding set of encoded data slices associated with a primary storage unit requires rebuilding and includes one or more excess encoded data slices of the plurality of sets of encoded data slices stored in the secondary storage units;

identify the excess encoded data slices based on scan response messages from the secondary storage units;

assign, for each data segment of the plurality of data segments stored as a plurality of sets of encoded data slices and including, in the plurality of sets of encoded data slices, both an encoded data slice requiring rebuilding and an excess encoded data slice, a priority level in accordance with a prioritization scheme; and

facilitate, for each data segment, rebuilding of the at least one encoded data slice requiring rebuilding and deletion of excess encoded data slices requiring deletion in accordance with the assigned priority level of the data segment.

10. The computing device of claim 9, wherein the processing module functions to determine comprises:

issuing a scan request to rebuild messages to primary storage units and secondary storage units for the plurality of data segments, receive scan response rebuilding messages; and

identifying the at least one encoded data slice requiring rebuilding based on the scan response rebuilding messages from the primary storage units.

11. The computing device of claim 10, wherein the identifying the one encoded data slice requiring rebuilding comprises identifying a missing encoded data slice based on a desired pattern.

12. The computing device of claim 9 wherein identifying the excess encoded data slice is based on a desired pattern.

13. The computing device of claim 9, wherein the prioritization scheme comprises:

highest priority for at least one encoded data slice to be rebuilt, one corresponding replacement encoded data slice to be deleted, and at least one excess encoded data slice to be deleted;

next highest priority for at least one encoded data slice to be rebuilt, one corresponding replacement encoded data slice to be deleted;

next lowest priority for at least one encoded data slice to be rebuilt; and

lowest priority for only one or more encoded data slices to be deleted.

14. The computing device of claim 9, wherein the rebuilding is performed on data segments associated with a highest priority first followed by a next highest priority.

15. The computing device of claim 9, wherein the rebuilding comprises:

issuing read slice request rebuilding messages;

receiving read slice response rebuilding messages;

generating a rebuilt encoded data slice;

issuing a write slice request rebuilding message that includes the rebuilt encoded data slice to a primary storage unit;

receiving a write slice response confirming storage of the rebuilt encoded data slice; and

deleting excess encoded data slices.

16. The computing device of claim 9, wherein the deletion of excess encoded data slices comprises:

issuing a delete slice request affinity message to a corresponding one of the secondary storage units; and

receiving a delete slice response affinity message confirming deletion of the encoded data slice.