WEAVER codes: Highly fault tolerant erasure codes for storage systems

FAST 2005 - 4th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2005, Pages 211-224

  Hafner, James Lee ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DIGITAL STORAGE; FAULT TOLERANCE; FORWARD ERROR CORRECTION;

DESIGN FEATURES; ERASURE CODES; FAULT-TOLERANT; IN-DEGREE; MAXIMUM DISTANCE; RAID CONTROLLERS; STORAGE EFFICIENCY; STORAGE SYSTEMS;

C (PROGRAMMING LANGUAGE);

EID: 44049101334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Baylor, P. Corbett, and C. Park. Efficient method for providing fault tolerance against double device failures in multiple device systems, January 1999. U. S. Patent 5,862,158.
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 Computers, 44:192–202, 1995.
3. M. Blaum, J. Brady, J. Bruck, J. Menon, and A. Vardy. The EVENODD code and its generalization. In J. Jin, T. Cortest, and R. Buyya, editors, High Performance Mass Storage and Parallel I/O: Technologies and Applications, chapter 14, pages 187–208. IEEE and Wiley Press, New York, 2001.
4. M. Blaum and R. M. Roth. On lowest density MDS codes. IEEE Transactions on Information Theory, 45:46–59, 1999.
5. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row-diagonal parity for double disk failure. In Proceedings of the Third USENIX Conference on File and Storage Technologies, pages 1–14, 2004.
6. L. J. Dickson. Data redundancy methods and apparatus, October 2003. U. S. Patent Application US2003/0196023 A1.
7. R. G. Gallager. Low-Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.
8. G. A. Gibson, L. Hellerstein, R. M. Karp, R. H. Katz, and D. A. Patterson. Failure correction techniques for large disk arrays. In Proceedings of International Conference on Architectural Support for Programming Languages and Operating Systems, pages 123–132, Boston, MA, 1989.
9. J. L. Hafner, V. Deenadhayalan, T. Kanungo, and KK Rao. Performance metrics for erasure codes in storage systems. Technical Report RJ 10321, IBM Research, San Jose, CA, 2004.
10. J. L. Hafner, V. Deenadhayalan, KK Rao, and J. A. Tomlin. Matrix methods for lost data reconstruction in erasure codes. In Proceedings of the Fourth USENIX Conference on File and Storage Technologies, San Francisco, CA USA, December 2005.
11. M. G. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47:569–584, 2001.
12. J. S. Plank, R. L. Collins, A. L. Buchsbaum, and M. G. Thomason. Small parity-check erasure codes – exploration and observations. In Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN’05), 2005.
13. J. S. Plank and M. G. Thomason. A practical analysis of low-density parity-check erasure codes for wide-area storage applications. In Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN’04), 2004.
14. 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.
15. J. A. Wiencko, Jr., K. Land, and L. J. Dickson. Data redundancy methods and apparatus, April 2003. U. S. Patent 6,557,123 B1.
16. A. Wilner. Multiple drive failure tolerant raid system, December 2001. U. S. Patent 6,327,672 B1.
17. L. Xu and J. Bruck. X-code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory, IT-45:272–276, 1999.
18. G. V. Zaitsev, V. A. Zinovev, and N. V. Semakov. Minimum-check-density codes for correcting bytes of errors. Problems in Information Transmission, 19:29–37, 1983.