Veritas Technologies LLC

Deodatta Barhate

Sushrut Gajbhiye

Roshan Kolhe

Anindya Banerjee

Shailesh Marathe

Pritam Bankar

Aniruddha Gokhale

The disclosed computer-implemented method for detecting bit rot in distributed storage devices having failure domains may include (1) receiving, at a computing device, a combination of data chunks created by adding, for each failure domain storing data chunks, data chunks from different stripes, (2) receiving a combination of parity chunks created by adding, for each failure domain storing parity chunks, parity chunks from the different stripes, (3) creating at least one new parity chunk from the combination of data chunks, and (4) identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match the combination of parity chunks. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for detecting bit rot in distributed storage devices having failure domains

The disclosed computer-implemented method for caching in an erasure-coded system may include partitioning data into data chunks and storing the data chunks across at least two data storage devices. The method may also include encoding the data chunks into at least one parity chunk and storing the at least one parity chunk on at least one parity storage device. The method may further include caching (parity and/or data functions) to at least one storage device, when a threshold value is reached. The method may include detecting a storage failure on one of the data storage devices and subsequent thereto, prioritizing the caching of certain functions over those of others. Various other methods, systems, and computer-readable media are also disclosed.

Systems and methods for caching in an erasure-coded system

The disclosed computer-implemented method for selecting a set of storage nodes from a plurality of storage nodes for use in reconstructing data on a faulted node in an erasure-coded system may include determining an average read access latency for a first set of storage nodes, detecting a storage failure a storage node, selecting a subset of the first set of storage nodes, such that the average read access latency for each of the storage nodes within the subset has a lower average read access latency than at least one other node (or as many as all the other nodes) of the available storage nodes, and reconstructing data that was stored on the failed storage node from the subset of the first set of storage nodes. During reconstruction, each of the nodes multiplies their data chunk by a coefficient and transmits the resulting product to an initiator node.

Growing community of inventors

Pune, India

Deodatta Barhate