New efficient MDS array codes for RAID part II: Rabin-like codes for tolerating multiple (≤4) disk failures

IEEE Transactions on Computers

Volumn 54, Issue 12, 2005, Pages 1473-1483

  Feng, Gui Liang ^a   Deng, Robert H ^b   Bao, Feng ^b   Shen, Jia Chen ^a  

^a University of Louisiana at Lafayette   (United States)

^b Institute for Information Research   (Singapore)

Author keywords

MDS array codes; Multiple disk failures; Rabin codes; RAID

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; DECODING; ENCODING (SYMBOLS); MAGNETIC DISK STORAGE; MATRIX ALGEBRA;

CIRCULAR PERMUTATION MATRICES; HIGH-DENSITY PARITY-CHECK MATRIX; MAXIMUM DISTANCE SEPARABLE (MDS) ARRAY CODES; MULTIPLE DISK FAILURES; RABIN CODES; REDUNDANT ARRAYS OF INEXPENSIVE DISKS (RAID);

CODES (SYMBOLS);

EID: 30344465319     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2005.200     Document Type: Article

References (17)

1. D. Patterson, G. Gibson, and R. Katz, "A Case for Redundant Arrays of Inexpensive Disks (RAID)," Proc. ACM SIGMOD '88, pp. 109-116, June 1988.
2. P. Elias, "Coding for Two Noisy Channels," Information Theory, Proc. Third London Symp., pp. 61-76, Sept. 1955.
3. M. Blahut, Algebraic Codes for Data Transmission. Cambridge Univ. Press, 2003.
4. M. Blaum, "A Class of Byte-Correcting Array Code," IBM Research Report, RJ 5652(57151), May 1987.
5. M. Blaum, J. Bradt, J. Bruck, and J. Menon, "EVEN-ODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures," IEEE Trans. Computers, vol. 44, no. 2, pp. 192-202, Feb. 1995.
6. M. Blaum, J. Bruck, and A. Vardy, "MDS Array Codes with Independent Parity Symbols," IEEE Trans. Information Theory, pp. 529-542, Mar. 1996.
7. M. Blaum, H. Hao, R. Mattson, and J. Menon, "A Coding Technique for Double Disk Failures in Disk Arrays," US Patent 5,271,012, Dec. 1993.
8. M. Blaum and R. Roth, "New Array Codes for Multiple Phased Burst Correction," IEEE Trans. Information Theory, pp. 66-77, Jan. 1993.
9. M. Blaum and R. Roth, "On Lowest-Density MDS Codes," IEEE Trans. Information Theory, pp. 46-59, Jan. 1999.
10. T. Fuja, C. Heegard, and M. Blaum, "Cross Parity Check Convolutional Code," IEEE Trans. Information Theory, pp. 1264-1276, July 1989.
11. R. Goodman, R.J. McEliece, and M. Sayano, "Phased Burst Correcting Array Codes," IEEE Trans. Information Theory, pp. 684-693, Mar. 1993.
12. L. Xu and J. Bruck, "X-Code: MDS Array Codes with Optimal Encoding," IEEE Trans. Information Theory, pp. 272-276, Jan. 1999.
13. L. Xu, V. Bohossian, J. Bruck, and D.G. Wagner, "Low-Density MDS Codes and Factors of Complete Graphs," IEEE Trans. Information Theory, pp. 1817-1826, Sept. 1999.
14. M. Blaum, J. Bradt, J. Bruck, J. Menon, and A. Vardy, "The EVENODD Code and Its Generalization: An Efficient Scheme for Tolerating Multiple Disk Failures in RAID Architectures," High Performance Mass Storage and Parallel I/O, chapter 14, 2002.
15. G.-L. Feng, R. Deng, F. Bao, and J.-C. Shen, "New Efficient MDS Array Codes for RAID, Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures," IEEE Trans. Computers, vol. 54, no. 9, pp. 1071-1080, Sept. 2005.
16. M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balance, and Fault Tolerance," J. ACM, vol. 36, no. 2, pp. 335-348, Apr. 1989.
17. F.J. MacWilliams and N.J.A. Slone, The Theory of Error-Correcting Codes. Elsevier Science, 1977.