Multiple revision mailbox

• US 9,881,043 B2
• Filed: 08/04/2014
• Issued: 01/30/2018
• Est. Priority Date: 10/09/2007
• Status: Expired due to Fees

• Current Assignee: Pure Storage, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Resch, Jason K., Mark, Zachary J., Baptist, Andrew, Volvovski, Ilya
• Primary Examiner(s): Naji, Younes
• Application Number:
  US14/450,943
• Publication Number:
  US 20140344228A1
• Time in Patent Office: 1,275 Days
• Field of Search: None
• 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/1443 Transmit or communication errors
• CPC Class Codes: G06F 11/1474 in transactions G06F16/20 takes precedence
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 2211/1028 Distributed, i.e. distributed RAID systems with parity
• 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 slice names of encoded data slices stored within a dispersed storage network (DSN). The method continues by determining dispersed storage (DS) units within the DSN storing a set of the encoded data slices associated with the slice names. The method continues by determining one or more revision numbers associated with the slice names. The method continues by determining if same slice names have different associated revision numbers and, when the same slice names have different associated revision numbers, adding the slice names to a revision mailbox for subsequent correction.

Claims

1. A method comprises:

sending, by a computing device of a dispersed storage network (DSN), a slice name request to a set of storage units of the DSN regarding a set of encoded data slices, wherein a first storage unit of the set of storage units stores, or is assigned to store, a first encoded data slice of the set of encoded data slices, wherein each encoded data slice of the set of encoded data slices has a unique slice name that includes a unique pillar number and common slice name information;

determining, by each of at least some storage units of the set of storage units, a slice name response for a corresponding encoded data slice of the set of encoded data slices, the slice name response includes a slice name for the corresponding encoded data slice and revision number information of the corresponding encoded data slice;

receiving, by the computing device, the slice name responses from the at least some storage units;

determining, by the computing device, whether one of the slice name responses has different revision number information than other responses of the slice name responses;

when the one of the slice name responses has different revision number information than the other responses of the slice name responses, adding the slice name of the one of the slice name responses to a revision mailbox for rebuilding of the corresponding encoded data slice of the set of encoded data slices identified by the slice name; and

rebuilding, by a revision agent, the corresponding encoded data slice identified in the revision mailbox.

2. The method of claim 1 further comprising:

sending, by the computing device, a revision message to the revision agent regarding the corresponding encoded data slice identified in the revision mailbox.

3. The method of claim 2, wherein the revision message includes one or more of:

one or more slice names associated with different revision numbers;

revisions associated with the slice name;

a data identifier (ID);

a data object name;

a user ID;

a dispersed storage (DS) set ID;

or

a dispersed storage (DS) unit ID.

4. The method of claim 2, wherein the revision agent is a storage integrity processing unit.

5. The method of claim 1, wherein the revision number information comprises:

a most current revision number of the corresponding encoded data slice;

or

a list of revision numbers of the corresponding encoded data slice.

6. The method of claim 1, wherein the slice name request comprises one or more of:

a range of slice names for a plurality of sets of encoded data slices;

or

a discrete set of slice names for a set of encoded data slices.

7. The method of claim 1, wherein determining the slice name response is based on one or more of:

a first slice name;

a previous process progression;

an error message;

a command;

a list;

or

a predetermination.

8. A computer readable memory comprises:

a first memory section that stores operational instructions that, when executed by a computing device of a dispersed storage network (DSN), causes the computing device to;

send a slice name request to a set of storage units of the DSN regarding a set of encoded data slices, wherein a first storage unit of the set or storage units stores, or is assigned to store, a first encoded data slice of the set of encoded data slices, wherein each encoded data slice of the set of encoded data slices has a unique slice name that includes a unique pillar number and common slice name information;

a second memory section that stores operational instructions that, when executed by each of at least some storage units of the set or storage units, causes the each of at least some storage units to;

determine a slice name response for a corresponding encoded data slice of the set of encoded data slices, the slice name response includes a slice name for the corresponding encoded data slice and revision number information of the corresponding encoded data slice;

a third memory section that stores operational instructions that, when executed by the computing device, causes the computing device to;

receive the slice name responses from the at least some storage units;

determine whether one of the slice name responses has different revision number information than other responses of the slice name responses; and

when the one of the slice name responses has different revision number information than the other responses of the slice name responses, add the slice name of the one of the slice name responses to a revision mailbox for rebuilding of the corresponding encoded data slice or the set of encoded data slices identified by the slice name; and

a fourth memory section that stores operational instructions that, when executed by a revision agent, causes the revision agent to;

rebuild the corresponding encoded data slice identified in the revision mailbox.

9. The computer readable memory of claim 8, wherein the third memory section further stores operational instructions that, when executed by the computing device, causes the computing device to:

send a revision message to the revision agent regarding the corresponding encoded data slice identified in the revision mailbox.

10. The computer readable memory of claim 9, wherein the revision message includes one or more of:

one or more slice names associated with different revision numbers;

revisions associated with the slice name;

a data identifier (ID);

a data object name;

a user ID;

a dispersed storage (DS) set ID;

or

a dispersed storage (DS) unit ID.

11. The computer readable memory of claim 9, wherein the revision agent is a storage integrity processing agent.

12. The computer readable memory of claim 8, wherein the revision number information comprises:

a most current revision number of the corresponding encoded data slice;

or

a list of revision numbers of the corresponding encoded data slice.

13. The computer readable memory of claim 8, wherein the slice name request comprises one or more of:

a range of slice names for a plurality of sets of encoded data slices;

or

a discrete set of slice names for a set of encoded data slices.