Reliability Analysis for Full-2 Code

Recently, with the fast development of storage system, 2-erasure coding schemes were widely used in industrial society. To meet different requirements, many kinds of 2-erasure coding schemes were presented, such as Reed-Solomon codes, binary linear codes, parity array codes, and so on. Full-2 code is a 2-erasure binary linear code. It is a non-MDS code, but achieves optimal encoding, decoding, and updating performance. Moreover, its fault tolerance is beyond 2, i.e. “2-erasure” is the huge undervaluation of its fault tolerance. It is hard to evaluate the precise reliability of full-2 code. The reason is that the reliability model is complex and the proportion of recoverable k-erasures (k ≫ 2) to total k-erasures is difficult to calculate. In this paper, we present a combinatorial method to analyze the precise reliability of full-2 code. The reliability of full-2 based storage systems is also evaluated.

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

[2]  Jehoshua Bruck,et al.  Low density MDS codes and factors of complete graphs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[4]  Zhou Jie.  The Study of Graph Decompositions and Placement of Parity and Data to Tolerate Two Failures in Disk Arrays: Conditions and Existance , 2003 .

[5]  Thomas Schwarz,et al.  Reliability and performance of disk arrays , 1994 .

[6]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[7]  James S. Plank,et al.  A practical analysis of low-density parity-check erasure codes for wide-area storage applications , 2004, International Conference on Dependable Systems and Networks, 2004.

[8]  R. Stanley.  Enumerative Combinatorics: Volume 1 , 2011 .

[9]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[10]  James S. Plank,et al.  A tutorial on Reed–Solomon coding for fault‐tolerance in RAID‐like systems , 1997, Softw. Pract. Exp..

[11]  Michael G. Pecht,et al.  Enhanced Reliability Modeling of RAID Storage Systems , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[12]  Randy H. Katz,et al.  Coding techniques for handling failures in large disk arrays , 2005, Algorithmica.

[13]  James S. Plank,et al.  Small parity-check erasure codes - exploration and observations , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[14]  James Lee Hafner,et al.  WEAVER codes: highly fault tolerant erasure codes for storage systems , 2005, FAST'05.

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