Precomputed redundancy code matrices for high-availability data storage
US9495249B1 · kind B1 · utility
56Cited by
0References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 31, 2015 |
| Grant date | Nov 15, 2016 |
| Priority date | — |
| Expiry date | May 15, 2035 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/154
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.