Efficient repair of erasure coded data based on coefficient matrix decomposition
AssigneeCisco Technology, Inc.
InventorsMárton Ákos Sipos, Narayan Venkat, Joshua Bernard Gahm, John George Apostolopoulos
Life of this patent
Estimating the term…
Loading patent…
AssigneeCisco Technology, Inc.
InventorsMárton Ákos Sipos, Narayan Venkat, Joshua Bernard Gahm, John George Apostolopoulos
Estimating the term…
A controller device is configured to communicate with storage nodes of a distributed storage system (DSS) in which erasure codes are used to encode source data onto the storage nodes and ranks of matrices containing coding coefficients associated with the erasure codes indicate whether repairs of failed storage nodes of the DSS are feasible. A decomposition structure is generated to be used as a guide for transforming the matrices to upper triangle form (UTF) for use in computing the ranks of the matrices. While the DSS is operating to perform repairs of the failed storage nodes, as part of determining feasible repair strategies that will preserve subsequent repairs of failed storage nodes, the ranks of the matrices are computed by transforming the matrices to UTF using operations on the submatrices according to the decomposition structure.
A method comprising:
An apparatus comprising:
A non-transitory processor readable medium storing instruction that, when executed by a processor of a controller device configured to communicate with storage nodes of a distributed storage system in which erasure codes are used to encode source data onto the storage nodes and ranks of matrices containing coding coefficients associated with the erasure codes indicate whether repairs of failed storage nodes of the distributed storage system are feasible, cause the processor to:
Dependencies are inferred from the claim text.