GRID codes: Strip-based erasure codes with high fault tolerance for storage systems

ACM Transactions on Storage

Volumn 4, Issue 4, 2009, Pages

  Li, Mingqiang ^a   Shu, Jiwu ^a   Zheng, Weimin ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Disk failure; Erasure code; Fault tolerance; Storage system; Unrecoverable sector error

Indexed keywords

DATA RELIABILITIES; DIMENSIONAL GRIDS; DISK FAILURE; ERASURE CODE; ITERATIVE RECONSTRUCTION ALGORITHMS; REGULAR STRUCTURES; STORAGE EFFICIENCIES; STORAGE SYSTEM; UNRECOVERABLE SECTOR ERROR;

DISKS (STRUCTURAL COMPONENTS); ERRORS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; QUALITY ASSURANCE;

RELIABILITY;

EID: 60449118872     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1480439.1480444     Document Type: Article

References (38)

1. AGUILERA, M. K., JANAKIRAMAN, R., AND XU, L. 2005. Using erasure codes efficiently for storage in a distributed system. In Proceedings of the Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'05), 336-345.
2. ANNE, N. B., THIRUNAVUKKARASU, U., AND LATIFI, S. 2004. Three and four-dimensional parity-check codes for correction and detection of multiple errors. In Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC), vol. 2. IEEE Computer Society, 840-845.
3. 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. ACM Press, New York, 289300.
4. BLAUM, M., BRADY, J., BRUCK, J., MENON, J., AND VARDY, A. 2001. The EVENODD code and its generalization: An efficient scheme for tolerating multiple disk failures in RAID architectures. In High Performance Mass Storage and Parallel I/O: Technologies and Applications, 187-208.
5. BLAUM, M., BRÜCK, J. AND VARDY, A. 1996. MDS array codes with independent parity symnbols. IEEE Trans. Inf. Theory 42, 2, 529-542.
6. 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.
7. BLOEMER, J., KALFANE, M., KARP, R., KARPINSKI, M., LUBY, M., AND ZUCKERMAN, D. 1995. An XOR-based erasure resilient coding scheme. Tech. rep. TR-95-048, International Computer Science Institute, Berkeley, California.
8. CHEN, R M., LEE, E. K., GIBSON, G. A., KATZ, R. H., AND PATTERSON, D. A. 1994. RAID: HighPerformance, reliable secondary storage. ACM Comput. Surv. 26, 2,145-185.
9. COLLINS, R. L. AND PLANK, J. S. 2005. Assessing the performance of erasure codes in the wide-area. In Proceedings of the Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'05), 182-187.
10. rd USENLX Conference on File and Storage Technologies (FAST'04). USENIX Association, 1-14.
11. FENG, G.-L., DENG, R. H., BAO, F., AND SHEN, J. C. 2005a. New efficient MDS array codes for RAID, Part I. Reed-Solomon-Like codes for tolerating three disk failures. IEEE Trans. Comput. 54, 9, 1071-1080.
12. PENG, G.-L., DENG, R. H., BAO, F., AND SHEN, J. C. 2005b. New efficient MDS array codes for RAID, Part II. Rabin-Like codes for tolerating multiple (greater than or equal to 4) disk failures. IEEE Trans. Comput. 54, 12, 1473-1483.
13. FRØLUND, S. MERCHANT, A., SAITO, Y., SPENCE, S., AND VEITCH, A. 2004. A decentralized algorithm for erasure-coded virtual disks. In Proceedings of the Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'04), 125-134.
14. GALLAGER, R. G. 1962. Low density parity check codes. IRE Trans. Inf. Theory 8, 1, 21-28.
15. GOODSON, G. R., WYLIE, J. J., GRANGER, G. R., AND REITER, M. K. 2004. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'04), 135-144.
16. th Annual IEEE IIFIP International Conference on Dependable Systems and Networks (DSN'08). IEEE Computer Society, 147-156.
17. HAFNER, J. L. 2006. Hover erasure codes for disk arrays. In Proceedings of the Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'06). IEEE Computer Society, 217-226.
18. th USENIX Conference on File and Storage Technologies (FAST'05). USENIX Association, 211-224.
19. HAFNER, J. L., DEENADHAYALAN, V., KANUNGO, T., AND RAO, K. K. 2004. Performance metrics for erasure codes in storage systems. Tech. rep. RJ 10321 (A0408-003). IBM Research Division, Almaden Research Center. August.
20. th USENIX Conference on File and Storage Technologies (FAST'05). USENIX Association.
21. LUBY, M. C., MITZENMACHER, M., SHOKROLLAHI, M. A., AND SPIELMAN, D. A. 2001. Efficient erasure correcting codes. IEEE Trans. Inf. Theory 47, 2, 569-584.
22. MACWILLIAMS, F. J. AND SLOANE, N. J. A. 1977. The Theory of Error-Correcting Codes. North-Holland, New York.
23. th USENLX Conference on File and Storage Technologies (FAST'07). USENIX Association, 17-29.
24. PLANK, J. S. 2008. The RAID-6 liberation codes. In Proceedings of the 6th USENIX Conference on File and Storage Technologies (FAST'08). USENIX Association, 1-14.
25. th USENIX Conference on File and Storage Technologies (FAST'05). http://www.cs.utk.edu/~plank/ plank/papers/FAST-2005.html.
26. PLANK, J. S. AND THOMASON, M. G. 2004. A practical analysis of low-density parity-check erasure codes for wide-area storage applications. In Proceedings of tfie Annual IEEEIIFIP International Conference on Dependable Systems and Networks (DSN'04). IEEE Computer Society.
27. th IEEE International Symposium on Network Computing and Applications (NCA'06). IEEE Computer Society, 173-180.
28. 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 Annual, IEEE IIFIP International Conference on Dependable Systems and Networks (DSN'05). IEEE Computer Society, 326-335.
29. REED, I. S. AND SOLOMON, G. 1960. Polynomial codes over certain finite fields. J. Soc. Industrial Appl. Math. 8, 2, 300-304.
30. ROTH, R. M. AND LEMPEL, A. 1989. On MDS codes via Cauchy matrices. IEEE Trans. Inf. Theory 35, 6, 1314-1319.
31. RUBINOFF, M. 1961. N-Dimensional codes for detecting and correcting multiple errors. Commun. ACM 4, 12, 545-551.
32. th USENLX Conference on File and Storage Technologies (FAST'07). USENIX Association, 1-16.
33. TANNER, R. M. 1981. A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 5, 533-547.
34. WILCKE, W. W., GARNER, R. B., FLEINER, C., FREITAS, R. P., GOLDING, R. A., GLIDER, J. S., KENCHAMMANA-HOSEKOTE, D. R., HAFNER, J. L., MOHIUDDIN, K. M., RAO, K. K., BECKER-SZENDY, R. A., WONG, T. M., ZAKI, O. A., HERNANDEZ, M., FERNANDEZ, K. R., HUELS, H., LENK, H., SMOLIN, K., RIES, M., GOETTERT, C, PICUNKO, T., KAHN, H., AND LOO, T. 2006. IBM intelligent bricks project: Petabytes and beyond. IBM J. Res. Devel. 50, 2-3, 181-197.
35. WONG, T. E., AND SHEA, J. M. 2001. Multi-Dimensional parity check codes for bursty channels. In Proceedings of the IEEE International Symposium on Information Theory (ISITOl), 123.
36. th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07). IEEE Computer Society, 206-215.
37. XIA, H. AND CHIEN, A. A. 2007. Robustere: A distributed storage architecture with robust and high performance. In Proceedings of the ACMI IEEE Conference on SuperComputing (SC'07), 1-11.
38. XU, L. AND BRÜCK, J. 1999. X-Code: MDS array codes with optimal encoding. IEEE Trans. Inf. Theory 45, 1, 272-276.