Application and Performance Analysis of EVENODD in RAID Architecture
DOI:
https://doi.org/10.54097/5jqypb55Keywords:
Storage system, RAID architecture, Erasure codes, EVENODD.Abstract
As storage systems are developed and used in different environments, people require more stable and reliable storage systems. As one of the main methods of storage system fault tolerance, EVENODD has received more and more attention. Compared with the traditional RS coding, EVENODD is completely based on the XOR operation, which is very important in the research of erasure correction. Firstly, the paper introduces the RAID architecture and the current typical and common erasure codes. Then, the possible prospects for using EVENODD and the coding implementation are described in detail. Besides, the paper compares the existing erasure codes from the perspective of encoding and decoding speed. Through the comparison and analysis, it is concluded that EVENODD has different degrees of defects in terms of fault tolerance and computational efficiency. How to improve the design of erasure codes with higher fault tolerance and computational efficiency based on EVENODD is an issue that deserves further research in the future.
Downloads
References
D. Patterson, G. Gibson, and R. Katz.: A case for redundant arrays of inexpensive disks (RAID). ACM SIGMOD 17(3), 109-116 (1998).
P. Chen et al.: RAID: high-performance, reliable secondary storage, ACM Computing Surveys 26 (2), 145-185, (1994).
M. Blaum, J. Brady, J. Bruck and Jai Menon.: EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computers 44(2), 192-202 (1995).
J. S. Plank, J. Luo, C. D. Schuman, L. Xu, and Z. W. O'Hearn: A performance evaluation and examination of open-source erasure coding libraries for storage. In 7th USENIX Conference on File and Storage Technologies (FAST), pp. 253-265, 2009.
F. J. MacWilliams, N. J. A. Sloane.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam, the Netherlands (1977).
I. S. Reed and G. Solomon.: Polynomial Codes over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics 8(2), 300-304 (1960).
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, 1995.
P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar.: Row Diagonal Parity for Double Disk Failure Correction. FAST-2004: 3rd Usenix Conference on File and Storage Technologies, San Francisco, CA (2004).
M. Blaum and R. M. Roth.: On Lowest Density MDS Codes. IEEE Transactions on Information Theory, 45(1), 46- 59, (1999).
C. Huang, J.Li and M. Chen.: On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. ITW'07, Information Theory Workshop, IEEE, Tahoe City, CA, September, 2007, pp. 218-223.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Highlights in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
