Advanced Parity Calculation Techniques in EVENODD Coding: A Comparative Analysis of Fault Tolerance and Computational Efficiency

Authors

  • Zijun Wang

DOI:

https://doi.org/10.61173/ww1ryv48

Keywords:

EVENODD Coding, Fault Tolerance Optimization, Data Storage Security

Abstract

In today’s data-driven era, the reliability and security of data storage have attracted much attention. The rapid development of big data, cloud computing and Internet of Things technology has put forward higher requirements for the fault tolerance of data storage. Especially in critical areas such as finance and healthcare, where data integrity and recoverability are critical, data loss or corruption can have catastrophic consequences.Although traditional RAID technology improves data redundancy, its scalability, cost effectiveness and fault tolerance efficiency are limited in the face of big data challenges. Especially in large-scale data centers, RAID is difficult to balance high performance with high fault tolerance.EVENODD coding , as a new fault-tolerant technology, improves recovery efficiency through double parity check. However, the computational complexity of the second parity column (Parity2) is high, which affects the coding efficiency and resource utilization.This research focuses on optimizing the computational method of Parity2 in EVENODD encoding, aiming at improving fault tolerance and reducing complexity, providing technical support for building efficient and reliable data storage system, and ensuring data security and integrity.

References

[1] Hamming Codes: Hamming, R. W. (1950). “Error detecting and error correcting codes.” The Bell System Technical Journal, 29(2), 147-160.

[2] CRC: W. Wesley Peterson and D. T. Brown, “Cyclic codes for error detection,” in Proceedings of the IRE, vol. 49, no. 1, pp. 228-235, Jan. 1961.

[3] LDPC Codes: Gallager, R. (1962). “Low-density paritycheck codes.” IRE Transactions on Information Theory, 8(1), 21- 28.

[4] Reed-Solomon Codes: Reed, I. S., & Solomon, G. (1960). “Polynomial codes over certain finite fields.” Journal of the Society for Industrial and Applied Mathematics, 8(2), 300-304.

[5] EVENODD Encoding: Blaum, M., Bruck, J., & Vardy, A. (1995). “EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures.” IEEE Transactions on Computers, 44(2), 192-202.

[6] Enhanced EVENODD Decoding: Plank, J. S., & Xu, L. (2003). “Optimizing Cauchy Reed-Solomon Codes for Fault- Tolerant Network Storage Applications.” In Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications (NCA), 173-180.

[7] Blaum, M., Bruck, J., & Vardy, A. (1995). EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computers, 44(2), 192-202. doi:10.1109/12.368014

[8] Xu, L., Xie, V. M., & Chien, A. A. (1999). A Hybrid Coding Scheme for RAID Architectures: Reliability and Performance Comparison. IEEE Transactions on Parallel and Distributed Systems, 10(6), 645-656. doi:10.1109/71.774889

[9] Plank, J. S., & Ding, K. (2013). XOR’s Code: A Proposal for the RAID-6 Erasure Code. Fast Memory Systems for HPC Workshop, 1-6.

[10] Rizzo, L. (1997). Effective Erasure Codes for Reliable Computer Communication Protocols. ACM SIGCOMM Computer Communication Review, 27(2), 24-36. 11. MacWilliams, F. J., & Sloane, N. J. A. (1977). The Theory of Error-Correcting Codes. Elsevier.

[11] Blomer, J., & Kalfane, M. (1996). An XOR-based Scheme for Erasure Codes in Storage Systems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC ’96), 63-70.

[12] Plank, J. S. (2005). The RAID-6 Liberation Codes. Proceedings of the 4th USENIX Conference on File and Storage Technologies (FAST ’05), 1-14.

Downloads

Published

2024-12-31

Issue

Vol. 2 No. 6 (2024): Volume 2, Issue 6

Section

Articles

License

Copyright (c) 2024 by the authors.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.