Abstract
RAID-6 codes protect disk array storage systems from two-disk failures. This article presents a complete treatment of a class of RAID-6 codes, called minimum density RAID-6 codes, that have an optimal blend of performance properties. There are two families of minimal density RAID-6 codes: Blaum-Roth codes and Liberation codes, and a separate special-purpose code called the Liber8tion code. The first of these have been known since the late 1990's, while the latter two are new constructions. In this article, we motivate, demonstrate, and evaluate the minimum density codes, comparing them to EVENODD and RDP codes, which represent the state-of-the-art in RAID-6. Following that, we prove that the codes indeed fit the RAID-6 methodology, and cite their implementation in an open-source library.
- Anvin, H. P. 2007. The mathematics of RAID-6. http://kernel.org/pub/linux/kernel/people/hpa/raid6.pdf.Google Scholar
- Bairavasundaram, L. N., Goodson, G., Schroeder, B., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2008. An analysis of data corruption in the storage stack. In Proceedings of the 6th Usenix Conference on File and Storage Technologies (FAST'08). Google Scholar
Digital Library
- Blaum, M., Brady, J., Bruck, J., and Menon, J. 1995. EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Trans. Comput. 44, 2, 192-- 202. Google Scholar
Digital Library
- Blaum, M. and Roth, R. M. 1999. On lowest density MDS codes. IEEE Trans. Inf. Theory 45, 1, 46--59. Google Scholar
Digital Library
- Blomer, J., Kalfane, M., Karpinski, M., Karp, R., Luby, M., and Zuckerman, D. 1995. An XOR-based erasure-resilient coding scheme. Tech. rep. TR-95-048, International Computer Science Institute.Google Scholar
- Bohossian, V. and Bruck, J. 2006. Shortening array codes and the perfect 1-Factorization conjecture. In Proceedings of the IEEE International Symposium on Information Theory. 2799--2803.Google Scholar
- Corbett, P., English, B., Goel, A., Grcanac, T., Kleiman, S., Leong, J., and Sankar, S. 2004. Row diagonal parity for double disk failure correction. In Proceedings of the 3rd Usenix Conference on File and Storage Technologies. Google Scholar
Digital Library
- Elerath, J. G. and Pecht, M. 2007. Enhanced reliability modeling of RAID storage systems. In International Conference on Dependable Systems and Networks (DSN'07). IEEE. Google Scholar
Digital Library
- EMC Corporation. 2007. EMC CLARiiON RAID 6 technology—A detailed review. Tech. rep. White Paper H2891, EMC Corporation.Google Scholar
- Hafner, J. L. 2005. WEAVER Codes: Highly fault tolerant erasure codes for storage systems. In Proceedings of the 4th Usenix Conference on File and Storage Technologies (FAST'05). 211--224. Google Scholar
Digital Library
- Hafner, J. L. 2006. HoVer erasure codes for disk arrays. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'06). IEEE. Google Scholar
Digital Library
- Hafner, J. L., Deenadhayalan, V., Belluomini, W., and Rao, K. 2008. Undetected disk errors in RAID arrays. IBM J. Res. Devel. 52, 4-5, 418--425. Google Scholar
Digital Library
- Hafner, J. L., Deenadhayalan, V., Rao, K. K., and Tomlin, A. 2005. Matrix methods for lost data reconstruction in erasure codes. In Proceedings of the 4th Usenix Conference on File and Storage Technologies (FAST'05). 183--196. Google Scholar
Digital Library
- Huang, C., Chen, M., and Li, J. 2007. Pyramid codes: Flexible schemes to trade space for access efficienty in reliable data storage systems. In Proceedings of the 6th IEEE International Symposium on Network Computing Applications (NCA'07).Google Scholar
- Huang, C. and Xu, L. 2005. STAR: An efficient coding scheme for correcting triple storage node failures. In Proceedings of the 4th Usenix Conference on File and Storage Technologies (FAST'05). 197--210. Google Scholar
Digital Library
- Lancaster, P. and Tismenetsky, M. 1985. The Theory of Matrices, 2nd ed. Computer Science and Applied Mathematics. Academic Press, San Diego, CA.Google Scholar
- Lueth, C. 2006. RAID-DP: Network appliance implementation of RAID double parity for data protection—A high-speed implementation of RAID 6. Tech. rep. TR-3298, Network Appliance.Google Scholar
- Luo, J., Xu, L., and Plank, J. S. 2009. An efficient XOR-scheduling algorithm for erasure codes encoding. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'09). IEEE.Google Scholar
- MacWilliams, F. J. and Sloane, N. J. A. 1977. The Theory of Error-Correcting Codes, Part I. North-Holland Publishing Company, Amsterdam.Google Scholar
- Moon, T. K. 2005. Error Correction Coding: Mathematical Methods and Algorithms. John Wiley & Sons, New York. Google Scholar
Digital Library
- Oprea, A. and Juels, A. 2010. A clean-slate look at disk scrubbing. In Proceedings of the 8th Usenix Conference on File and Storage Technologies (FAST'10). 57--70. Google Scholar
Digital Library
- Oral, S., Wang, F., Dillow, D., Shipman, G., and Miller, R. 2010. Efficient object storage journaling in a distributed parallel file system. In Proceedings of the 8th Usenix Conference on File and Storage Technologies (FAST'10). 143--154. Google Scholar
Digital Library
- Peterson, W. W. and Weldon, Jr., E. J. 1972. Error-Correcting Codes, 2nd Ed. The MIT Press, Cambridge, MA.Google Scholar
- Plank, J. S. 1997. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Soft. Pract. Exper. 27, 9, 995--1012. Google Scholar
Digital Library
- Plank, J. S. 2008a. A new minimum density RAID-6 code with a word size of eight. In Proceedings of the 7th IEEE International Symposium on Network Computing Applications (NCA'08). Google Scholar
Digital Library
- Plank, J. S. 2008b. The RAID-6 Liberation codes. In Proceedings of the 6th Usenix Conference on File and Storage Technologies (FAST'08). 97--110. Google Scholar
Digital Library
- Plank, J. S., Buchsbaum, A. L., Collins, R. L., and Thomason, M. G. 2005. Small parity-check erasure codes—Exploration and observations. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'05). IEEE. Google Scholar
Digital Library
- Plank, J. S., Luo, J., Schuman, C. D., Xu, L., and Wilcox-O'Hearn, Z. 2009. A performance evaluation and examination of open-source erasure coding libraries for storage. In Proceedings of the 7th Usenix Conference on File and Storage Technologies (FAST'09). 253--265. Google Scholar
Digital Library
- Plank, J. S., Simmerman, S., and Schuman, C. D. 2008. Jerasure: A library in C/C++ facilitating erasure coding for storage applications - Version 1.2. Tech. rep. CS-08-627, University of Tennessee. August.Google Scholar
- Reed, I. S. and Solomon, G. 1960. Polynomial codes over certain finite fields. J. Soc. Industr. Appl. Math. 8, 300--304.Google Scholar
Cross Ref
- Schroeder, B., Damouras, S., and Gill, P. 2010. Understanding latent sector errors and how to protect against them. In Proceedings of the 8th Usenix Conference on File and Storage Technologies (FAST'10). 71--84. Google Scholar
Digital Library
- Storage Networking Industry Association. 2010. 2010 SNIA dictionary. http://www.snia.org/education/dictionary/.Google Scholar
- Storer, M. W., Greenan, K. M., Miller, E. L., and Voruganti, K. 2008. Pergamum: Replacing tape with energy efficient, reliable, disk-based archival storage. In Proceedings of the 6th Usenix Conference on File and Storage Technologies (FAST'08). 1--16. Google Scholar
Digital Library
- Tu, T., Rendleman, C. A., Miller, P. J., Sacerdoti, F., Dror, R. O., and Shaw, D. E. 2010. Accelerating parallel analysis of scientific simulation data via Zazen. In Proceedings of the 8th Usenix Conference on File and Storage Technologies (FAST'10). 129--142. Google Scholar
Digital Library
- van Lint, J. H. 1982. Introduction to Coding Theory. Springer. Google Scholar
Digital Library
- Wylie, J. J. and Swaminathan, R. 2007. Determining fault tolerance of XOR-based erasure codes efficiently. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'07). IEEE. Google Scholar
Digital Library
- Xu, L., Bohossian, V., Bruck, J., and Wagner, D. 1999. Low density MDS codes and factors of complete graphs. IEEE Trans. Inf. Theory 45, 6, 1817--1826. Google Scholar
Digital Library
- Xu, L. and Bruck, J. 1999. X-Code: MDS array codes with optimal encoding. IEEE Trans. Inf. Theory 45, 1, 272--276. Google Scholar
Digital Library
- Zhu, B., Li, K., and Patterson, H. 2008. Avoiding the disk bottleneck in the Data Domain deduplication file system. In Proceedings of the 6th Usenix Conference on File and Storage Technologies (FAST'08). 269--282. Google Scholar
Digital Library
Index Terms
Minimum density RAID-6 codes
Recommendations
A Hybrid Approach to Failed Disk Recovery Using RAID-6 Codes: Algorithms and Performance Evaluation
The current parallel storage systems use thousands of inexpensive disks to meet the storage requirement of applications. Data redundancy and/or coding are used to enhance data availability, for instance, Row-diagonal parity (RDP) and EVENODD codes, ...
The Raid-6 Liber8Tion Code
Large centralized and networked storage systems have grown to the point where the single fault tolerance provided by RAID-5 is no longer enough. RAID-6 storage systems protect k disks of data with two parity disks so that the system of k + 2 disks may ...
A Comprehensive Study on RAID-6 Codes: Horizontal vs. Vertical
NAS '11: Proceedings of the 2011 IEEE Sixth International Conference on Networking, Architecture, and StorageThe RAID-6 architecture is playing an increasingly important role in modern storage systems. There are generally two kinds of RAID-6 codes, horizontal codes and vertical codes. Horizontal codes have been extensively studied and widely implemented, while ...






Comments