Implementation and Efficacy of EVENODD Coding in High-Reliability Data Storage Architectures

Authors

  • Yujie Zeng

DOI:

https://doi.org/10.61173/ssk6gr87

Keywords:

EVENODD encoding, High efficiency

Abstract

This paper provides a comprehensive examination of EVENODD encoding and its crucial role in enhancing data recovery processes, particularly under various failure scenarios. The study initiates with a detailed analysis of the foundational principles of EVENODD coding, emphasizing its unique capability to efficiently recover data in the event of multiple disk failures. By exploring the mechanics behind the generation of redundant data through XOR operations and the creation of parity bits, the paper illustrates how EVENODD encoding achieves robust fault tolerance. The research then conducts a comparative analysis between EVENODD and other established error correction methods, such as extended Hamming codes, Reed-Solomon codes, and cross parity. These methods are evaluated based on their performance in different failure contexts, focusing on their ability to recover data and their computational efficiency. The findings reveal that EVENODD encoding significantly outperforms these alternatives in scenarios involving multiple data disk failures, offering enhanced reliability and effectiveness. This makes EVENODD a highly valuable technique for high-reliability storage systems, where data integrity is paramount. The paper concludes by proposing future research directions aimed at further optimizing the computational complexity of EVENODD encoding. Additionally, it explores the potential for EVENODD’s application in distributed storage systems, where its fault tolerance capabilities could be particularly beneficial in maintaining data integrity across geographically dispersed environments.

References

[1] D. A. Patterson, P. Chen, G. Gibson, and R. H. Katz, “Introduction to Redundant Arrays of Inexpensive Disks (RAID),”in Proc. IEEE COMPCON, vol. 89, 1989, pp. 112–117.

[2] C. Huang and L. Xu, “STAR: An efficient coding scheme for correcting triple storage node failures,” IEEE Trans. Computers, vol. 57, no. 7, pp. 889–901, 2008.

[3] H. Jiang, M. Fan, Y. Xiao, X. Wang, and Y. Wu, “Improved decoding algorithm for the generalized EVENODD array code,” in International Conference on Computer Science and Network Technology, 2013, pp. 2216–2219.

[4] Y. Wang, G. Li, and X. Zhong, “Triple-Star: A coding scheme with optimal encoding complexity for tolerating triple disk failures in RAID,” International Journal of innovative Computing, Information and Control, vol. 3, pp. 1731–1472, 2012.

[5] Z. Huang, H. Jiang, and K. Zhou, “An improved decoding algorithm for generalized RDP codes,” IEEE Communications Letters, vol. 20, no. 4, pp. 632–635, 2016

[6] Z. Wang, A. G. Dimakis, and J. Bruck, “Rebuilding for array codes in distributed storage systems,” in IEEE GLOBECOM Workshops (GC Wkshps), 2010, pp. 1905–1909.

[7] L. Xiang, Y. Xu, J. Lui, and Q. Chang, “Optimal recovery of single disk failure in RDP code storage systems,” in ACM SIGMETRICS Performance Evaluation Rev., vol. 38, no. 1. ACM, 2010, pp. 119–130.

[8] L. Xiang, Y. Xu, J. C. S. Lui, Q. Chang, Y. Pan, and R. Li, “A hybrid approach of failed disk recovery using RAID-6 codes: Algorithms and performance evaluation,” ACM Trans. on Storage, vol. 7, no. 3, pp. 1–34, October 2011.

[9] Y. Zhu, P. P. C. Lee, Y. Xu, Y. Hu, and L. Xiang, “On the speedup of recovery in large-scale erasure-coded storage systems,” IEEE Transactions on Parallel & Distributed Systems, vol. 25, no. 7, pp. 1830–1840, 2014.

[10] P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson, “RAID: high-performance, reliable secondary storage,” University of California at Berkeley, Berkeley, Tech. Rep. CSD 03-778, 1993.

Downloads

Published

2024-10-29