skip to main content
research-article

Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array

Published:20 September 2012Publication History
Skip Abstract Section

Abstract

Many RAID-6 codes have been proposed in the literature, but each has its limitations. Horizontal code has the ability to adapt to the arbitrary size of a disk array but its high computational complexity is a major shortcoming. In contrast, the computational complexity of vertical code (e.g. X-code) often achieves the theoretical optimality, but vertical code is limited to using a prime number as the size of the disk array In this article, we propose a novel efficient RAID-6 code for arbitrary size of disk array: generalized X-code. We move the redundant elements along their calculation diagonals in X-code onto two specific disks and change two data elements into redundant elements in order to realize our new code. The generalized X-code achieves optimal encoding and updating complexity and low decoding complexity; in addition, it has the ability to adapt to arbitrary size of disk array. Furthermore, we also provide a method for generalizing horizontal code to achieve optimal encoding and updating complexity while keeping the code's original ability to adapt to arbitrary size of disk array.

References

  1. Bairavasundaram, L. N., Goodson, G. R., Pasupathy, S., and Schindler, J. 2007. An analysis of latent sector errors in disk drives. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS). ACM, New York, 289--300. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. Blaum, M., Bruck, J., and Vardy, A. 1996. MDS array codes with independent parity elements. IEEE Trans. Inf. Theory 42, 2, 529--542. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Blaum, M. and Roth, R. M. 1999. On lowest density MDS codes. IEEE Trans. Inf. Theory 45, 1, 46--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., and Patterson, D. A. 1994. RAID: High-performance, reliable secondary storage. ACM Comput. Surv. 26, 2, 145--185. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Corbett, P., English, B., Goel, A., Grcanac, T., Kleiman, S., Leong, J., and Sankar, S. 2004. Row-diagonal redundant for double disk failure correction. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST). USENIX, Berkeley, CA, 2--15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Feng, J., Chen, Y., and Summerville, D. 2010. EEO: An efficient MDS-like RAID-6 code for parallel implementation. In Proceedings of the 33rd IEEE Sarnoff Symposium. IEEE, Piscataway, NJ, 1--5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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). USENIX, Berkeley, CA, 211--224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Hafner, J. M., Deenadhayalan, V., Kanungo, T., and Rao, K. 2004. Performance metrics for erasure codes in storage systems. Tech. rep. RJ 10321, IBM Research, San Jose, CA.Google ScholarGoogle Scholar
  10. Jin, C., Jiang, H., Feng, D., and Tian, L. 2009. P-code: A new RAID-6 code with optimal properties. In Proceedings of the 23rd International Conference on Supercomputing (ICS). ACM, New York, 360--369. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Li, M., Shu, J., and Zheng, W. 2009. GRID codes: Strip-based erasure codes with high fault tolerance for storage systems. ACM Trans. Storage 4, 4, 1--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Patterson, D. A., Chen, P., Gibson, G., and Katz, R. H. 1989. Introduction to redundant arrays of inexpensive disks. In Proceedings of the IEEE COMPCON Conference. IEEE, Los Alamitos, CA, 112--117.Google ScholarGoogle Scholar
  13. Patterson, D. A., Gibson, G., and Katz, R. H. 1988. A case for redundant arrays of inexpensive disks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, 109--116. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Pinheiro, E., Weber, W. D., and Barroso, L. A. 2007. Failure trends in a large disk drive population. In Proceedings of 5th USENIX Conference on File and Storage Technologies (FAST). USENIX, Berkeley, CA, 17--28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Plank, J. 2008. The RAID-6 liberation codes. In Proceedings of 6th USENIX Conference on File and Storage Technologies (FAST). USENIX, Berkeley, CA, 97--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Plank, J. 2009. The RAID-6 liber8tion code. Internat. J. High Perform. Comput. Appl. 23, 3, 242--251. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Schroeder, B. and Gibson, G. A. 2007. Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you? In Proceedings of the 5th USENIX Conference on File and Storage Technologies (FAST). USENIX, Berkeley, CA, 1--16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Xu, L., Bohossian, V., Bruck, J., and Wagner, D. G. 1999. Low-density MDS codes and factors of complete graphs. IEEE Trans. Inf. Theory 45, 6, 1817--1826. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Xu, L. and Bruck, J. 1999. X-code: MDS array codes with optimal encoding. IEEE Trans. Inf. Theory 45, 1, 272--276. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!