A new minimum density RAID-6 code with a word size of eight

Proceedings of the 7th IEEE International Symposium on Networking Computing and Applications, NCA 2008

Volumn , Issue , 2008, Pages 85-92

  Plank, James S ^a  

^a University of Tennessee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DECODING; DISKS (MACHINE COMPONENTS); PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

INTERNATIONAL SYMPOSIUM; OPTIMAL COMBINATIONS; WORD SIZES;

DISKS (STRUCTURAL COMPONENTS);

EID: 51749108639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2008.29     Document Type: Conference Paper

References (25)

1. M. Beck et al. Logistical computing and internetworking: Middleware for the use of storage in communication. In Third Anual International Workshop on Active Middleware Services (AMS), San Francisco, August 2001.
2. M. Blaum, J. Brady, J. Bruck, and J. Menon. EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computing, 44(2):192-202, February 1995.
3. M. Blaum and R. M. Roth. On lowest density MDS codes. IEEE Transactions on Information Theory, 45(1):46-59, January 1999.
4. J. Blomer, M. Kalfane, M. Karpinski, R. Karp, M. Luby, and D. Zuckerman. An XOR-based erasure-resilient coding scheme. Technical Report TR-95-048, International Computer Science Institute, August 1995.
5. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row diagonal parity for double disk failure correction. In 4th Usenix Conference on File and Storage Technologies, San Francisco, CA, March 2004.
6. J. L. Hafner. WEAVER Codes: Highly fault tolerant erasure codes for storage systems. In FAST-2005: 4th Usenix Conference on File and Storage Technologies, pages 211-224, San Francisco, December 2005.
7. J. L. Hafner. HoVer erasure codes for disk arrays. In DSN-2006: The International Conference on Dependable Systems and Networks, Philadelphia, June 2006. IEEE.
8. J. L. Hafner, V. Deenadhayalan, K. K. Rao, and A. Tomlin. Matrix methods for lost data reconstruction in erasure codes. In FAST-2005: 4th Usenix Conference on File and Storage Technologies, pages 183-196, San Francisco, December 2005.
9. C. Huang, M. Chen, and J. Li. Pyramid codes: Flexible schemes to trade space for access efficienty in reliable data storage systems. In NCA-07: 6th IEEE International Symposium on Network Computing Applications, Cambridge, MA, July 2007.
10. C. Huang, J. Li, and M. Chen. On optimizing XOR-based codes for fault-tolerant storage applications. In ITW'07, Information Theory Workshop, pages 218-223, Tahoe City, CA, September 2007. IEEE.
11. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, Part I. North-Holland Publishing Company, Amsterdam, New York, Oxford, 1977.
12. J. S. Plank. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software - Practice & Experience, 27(9):995-1012, September 1997.
13. J. S. Plank. Jerasure: A library in C/C++ facilitating erasure coding for storage applications. Technical Report CS-07-603, University of Tennessee, September 2007.
14. J. S. Plank. The 48 sets of minimal density MDS RAID-6 matrices for a word size of eight. Technical Report UT-CS-08-611, University of Tennessee, March 2008.
15. J. S. Plank. The RAID-6 Liberation codes. In FAST-2008: 6th Usenix Conference on File and Storage Technologies, pages 97-110, San Jose, February 2008.
16. J. S. Plank, A. L. Buchsbaum, R. L. Collins, and M. G. Thomason. Small parity-check erasure codes - exploration and observations. In DSN-05: International Conference on Dependable Systems and Networks, Yokohama, Japan, 2005. IEEE.
17. J. S. Plank and Y. Ding. Note: Correction to the 1997 tutorial on Reed-Solomon coding. Software - Practice & Experience, 35(2):189-194, February 2005.
18. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8:300-304, 1960.
19. S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz. Maintenance-free global data storage. IEEE Internet Computing, 5(5):40-49, 2001.
20. M. W. Storer, K. M. Greenan, E. L. Miller, and K. Voruganti. Pergamum: Replacing tape with energy efficient, reliable, disk-based archival storage. In FAST-2008: 6th Usenix Conference on File and Storage Technologies, pages 1-16, San Jose, February 2008.
21. B. Welch, M. Unangst, Z. Abbasi, G. Gibson, B. Mueller, J. Small, J. Zelenka, and B. Zhou. Scalable performance of the panasas parallel file system. In FAST-2008: 6th Usenix Conference on File and Storage Technologies, pages 17-33, San Jose, February 2008.
22. J. J. Wylie and R. Swaminathan. Determining fault tolerance of XOR-based erasure codes efficiently. In DSN-2007: The International Conference on Dependable Systems and Networks, Edinburgh, Scotland, June 2007. IEEE.
23. L. Xu, V. Bohossian, J. Bruck, and D. Wagner. Low density MDS codes and factors of complete graphs. IEEE Transactions on Information Theory, 45(6):1817-1826, September 1999.
24. L. Xu and J. Bruck. X-Code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory, 45(1):272-276, January 1999.
25. B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the Data Domain deduplication file system. In FAST-2008: 6th Usenix Conference on File and Storage Technologies, pages 269-282, San Jose, February 2008.