US 10,379,952 B2Granted

Data recovery and regeneration using parity code

AssigneeWestern Digital Technologies, Inc.

InventorsRobert Eugeniu Mateescu, Cyril Guyot, Lluis Pamies-Juarez

Life of this patent

Estimating the term…

Loading patent…

Abstract

The disclosed technology can advantageously provide an efficient data recovery system including a plurality of storage nodes including a first storage node and a second storage node, and a storage logic that is coupled to the storage nodes and that manages storage of data on the storage nodes. The storage logic is executable to: receive a data set including data elements including a first set of data elements associated with the first storage node and a second set of data elements associated with the second storage node; generate a first parity of the data set, the first parity including a horizontal parity including a set of horizontal parity entries; and combine the data elements from the data set to produce a skipper parity including a set of skipper parity entries. Combining the data elements includes transforming a subset of the data elements from the data set using an invertible operation, the set of horizontal parity entries being different from the set of skipper parity entries.

Claims20

Dependent claims

A data storage system comprising:

a plurality of storage nodes including a first storage node and a second storage node;
and
memory storing storage logic that is coupled to the plurality of storage nodes and that manages storage of data on the plurality of storage nodes, the storage logic executable by a hardware processor to:
receive a data set including a plurality of data elements associated with the plurality of storage nodes, the data set including:
a first set of data elements associated with the first storage node;
and
a second set of data elements associated with the second storage node;
generate a horizontal parity including a set of horizontal parity entries that correspond to row combinations of the plurality of data elements associated with the plurality of storage nodes;
store the horizontal parity on a third storage node, the third storage node being different from the plurality of storage nodes;
generate a skipper parity including a set of skipper parity entries by transforming a subset of the data elements from the data set using an invertible operation, the set of horizontal parity entries being different from the set of skipper parity entries;
store the skipper parity on the third storage node;
and
responsive to determining a failure of the first storage node, recreating data elements of the first storage node using a portion of data elements associated with storage nodes of the plurality of storage nodes that have not failed in combination with the horizontal parity and the skipper parity.

10 more elements

Dependencies are inferred from the claim text.

Facts

Application: 15/626,027Filed 16 Jun 2017
Published: US 2018/0365107 A120 Dec 2018
Granted: 13 Aug 2019
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

G06F 11/1088
Parity data used in redundant arrays of independent storages, e.g. in RAID systems: reconstruction on already foreseen single or plurality of…
G06F 11/1076
Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's: parity data used in redundant arrays of…
H03M 13/373
Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35: with erasure…
H03M 13/3761
Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35: using code combining,…