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.
- 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 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., Bruck, J., and Vardy, A. 1996. MDS array codes with independent parity elements. IEEE Trans. Inf. Theory 42, 2, 529--542. 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
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Plank, J. 2009. The RAID-6 liber8tion code. Internat. J. High Perform. Comput. Appl. 23, 3, 242--251. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 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
Index Terms
Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array
Recommendations
P-Code: a new RAID-6 code with optimal properties
ICS '09: Proceedings of the 23rd international conference on SupercomputingRAID-6 significantly outperforms the other RAID levels in disk-failure tolerance due to its ability to tolerate arbitrary two concurrent disk failures in a disk array. The underlying parity array codes have a significant impact on RAID-6's performance. ...
Using Working Set Reorganization to Manage Storage Systems with Hard and Solid State Disks
ICPPW '14: Proceedings of the 2014 43rd International Conference on Parallel Processing WorkshopsScientific applications from many problem domains produce and/or access large volumes of data. To support these applications, designers of high-end computing (HEC) systems have greatly increased the capacity of storage systems in recent years. However, ...
Lonestar: An Energy-Aware Disk Based Long-Term Archival Storage System
ICPADS '11: Proceedings of the 2011 IEEE 17th International Conference on Parallel and Distributed SystemsWe present the architecture for an disk based archival storage system and propose a new RAID scheme that is designed for "write once, read sometimes" workloads. By intertwining parity groups into a multi-dimensional RAID and improving the single disk ...






Comments