PRECOMPUTED REDUNDANCY CODE MATRICES FOR HIGH-AVAILABILITY DATA STORAGE

• US 20170060687A1
• Filed: 11/14/2016
• Published: 03/02/2017
• Est. Priority Date: 03/31/2015
• Status: Active Grant

• Current Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Original Assignee: Amazon Technologies, Inc. (Amazon.com, Inc.)
• Inventors: Franklin, Paul David, Donlan, Bryan James, Lazier, Colin Laird, Suver, Claire Elizabeth
• Granted Patent: US 10,127,108 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• 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 11/167 Error detection by comparing the memory output
• CPC Class Codes: G06F 2211/1028 Distributed, i.e. distributed RAID systems with parity
• CPC Class Codes: G06F 2211/104 Metadata, i.e. metadata associated with RAID systems with parity
• 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/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/154 Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial
• CPC Class Codes: H03M 13/616 Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations

Abstract

Techniques described and suggested herein include systems and methods for precomputing regeneration information for data archives (“archives”) that have been processed and stored using redundancy coding techniques. For example, regeneration information, such as redundancy code-related matrices (such as inverted matrices based on, e.g., a generator matrix for the selected redundancy code) corresponding to subsets of the shards, is computed for each subset and, in some embodiments, stored for use in the event that one or more shards becomes unavailable, e.g., so as to more efficiently and/or quickly regenerate a replacement shard.

Claims

1. A computer-implemented method, comprising:

under the control of one or more computer systems configured with executable instructions,

receiving a first request to store an archive;

encoding, using a redundancy code, original data of the archive into a plurality of shards;

determining, from the plurality of shards and the redundancy code, at least one regeneration set, the regeneration set consisting of a subset of the plurality of shards and having a number of members equal to or greater than a minimum quorum of the plurality of shards sufficient to regenerate the original data;

computing one or more matrices for the regeneration set, the one or more matrices capable of being used with the corresponding subset of the plurality of shards to regenerate the original data;

storing the computed matrices and the plurality of shards;

in response to a second request, retrieving a matrix of the stored matrices that corresponds to a regeneration set associated with the second request; and

regenerating one or more shards associated with the second request using the retrieved matrix and the corresponding regeneration set.

2. The computer-implemented method of claim 1, wherein the one or more matrices are computed by inverting at least a portion of a generator matrix used by the redundancy code, the portion corresponding to the regeneration set.

3. The computer-implemented method of claim 1, wherein the determination of the regeneration set, the computation of the matrices, and the storage of the computed matrices occurs in connection with initialization of an application that accesses the archive.

4. The computer-implemented method of claim 1, wherein the second request includes an indication that a shard of the plurality of shards is unavailable.

5. The computer-implemented method of claim 4, wherein the regeneration set associated with the second request excludes the shard that is unavailable.

6. A system, comprising:

one or more processors; and

memory comprising one or more instructions that, as a result of being executed by the one or more processors, cause the system to at least;

receive a request to store an archive;

generate, using a redundancy code, a plurality of shards from original data of the archive;

determine one or more regeneration sets from the plurality of shards, the regeneration sets including a subset of the plurality of shards capable of regenerating the original data;

compute information from the redundancy code and corresponding to the regeneration sets, the computed information being usable to regenerate a replacement shard for at least a subset of the shards in the plurality; and

in response to a second request, use the computed information to regenerate data associated with the second request.

7. The system of claim 6, wherein the instructions, as a result of being executed, further compute the information from the redundancy code by generating matrices from the redundancy code that correspond to a respective regeneration set.

8. The system of claim 7, wherein the instructions, as a result of being executed, further generate the matrices by inverting at least a portion of a generator matrix used by the redundancy code, the portion corresponding to the respective regeneration set.

9. The system of claim 6, wherein the redundancy code is an erasure code.

10. The system of claim 6, wherein the instructions, as a result of being executed, further store, in a data store in communication with the system, the computed information.

11. The system of claim 6, wherein the instructions, as a result of being executed, further determine the one or more regeneration sets in connection with a second request.

12. The system of claim 6, wherein the instructions, as a result of being executed, further determine the one or more regeneration sets and compute the information in connection with receiving a second request.

13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by one or more processors of a computer system, cause the computer system to at least:

receive a first request associated with storing an archive;

determine one or more regeneration sets from a plurality of redundancy coded shards stored for the archive, each of the regeneration sets having a number of member shards equal to a quorum sufficient to regenerate the archive;

compute information for each of the regeneration sets that is usable by the computer system to regenerate any of the plurality of redundancy coded shards using the member shards of a respective regeneration set;

receive a second request associated with one or more unavailable shards of the plurality of redundancy coded shards; and

use at least a subset of the computed information to generate data to replace the unavailable shards.

14. The non-transitory computer-readable storage medium of claim 13, wherein the instructions, as a result of being executed by the one or more processors, further cause the computer system to determine the one or more regeneration sets such that each shard of the plurality of shards is capable of being regenerated by a respective regeneration set to which it does not belong.

15. The non-transitory computer-readable storage medium of claim 13, wherein the instructions, as a result of being executed by the one or more processors, further cause the computer system to compute the information for each of the regeneration sets based at least in part on one or more parameters of a redundancy code used to generate the shards from the archive.

16. The non-transitory computer-readable storage medium of claim 15, wherein the generated data to replace the unavailable shards includes at least one replacement shard.

17. The non-transitory computer-readable storage medium of claim 13, wherein the instructions, as a result of being executed by the one or more processors, further cause the computer system to store, in a data store associated with the computer system, the computed information for each of the regeneration sets.

18. The non-transitory computer-readable storage medium of claim 13, wherein the instructions, as a result of being executed by the one or more processors, further cause the computer system to determine the one or more regeneration sets and compute the information for each of the regeneration sets in connection with the first request and prior to receiving the second request.

19. The non-transitory computer-readable storage medium of claim 13, wherein the instructions, as a result of being executed by the one or more processors, further cause the computer system to generate the at least one replacement shard by generating original data of the archive.

20. The non-transitory computer-readable storage medium of claim 13, wherein the replacement shards are identical to the unavailable shards being replaced.