Tolerating triple disk failures in triple-parity RAID

This paper presents a mathematical method of tolerating triple disk failures in triple-parity redundant arrays of inexpensive disks (RAID), which is a further generalization of the work of Anvin [1] and Brown [2].

[1]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[2]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.

[3]  Chentao Wu,et al.  H-Code: A Hybrid MDS Array Code to Optimize Partial Stripe Writes in RAID-6 , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4]  Jiwu Shu,et al.  On cyclic lowest density MDS array codes constructed using starters , 2010, 2010 IEEE International Symposium on Information Theory.

[5]  Peter F. Corbett,et al.  Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!) , 2004, USENIX Conference on File and Storage Technologies.

[6]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[7]  Lidan Shou,et al.  F-Code: An Optimized MDS Array Code , 2007, ICIC.

[8]  Mario Blaum,et al.  Partial-MDS Codes and Their Application to RAID Type of Architectures , 2012, IEEE Transactions on Information Theory.

[9]  Hong Jiang,et al.  P-Code: a new RAID-6 code with optimal properties , 2009, ICS '09.