EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures

DOI10.1109/12.364531zbMath1068.68589OpenAlexW2147343704MaRDI QIDQ4419629

Jai Menon, Jim Brady, Jehoshua Bruck, Mario Blaum

Publication date: 14 October 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/29320/

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

On encoding symbol degrees of array BP-XOR codes ⋮ Zigzag decodable codes: linear-time erasure codes with applications to data storage ⋮ Linear programming bounds for distributed storage codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes ⋮ X-code double parity array operation with two disk failures ⋮ Failed disk recovery in double erasure RAID arrays ⋮ A cost effective fault-tolerant scheme for RAIDs ⋮ Optimizing large data transfers in parity-declustered data layouts ⋮ EVENODD ⋮ Codes for Distributed Storage ⋮ Maximum Distance Separable Codes Based on Circulant Cauchy Matrices ⋮ Recovering erasures by using MDS codes over extension alphabets