Efficiency Comparison of Row-Diagonal Parity and EVENODD Encoded Check Disk Repair Algorithms

Abstract

The high dependence on information technology in modern society leads to the ever-increasing demand for data reliability and availability. However, the increasing size of systems and the use of cheap but less reliable components have made component failures such as disk failures more common. As a new algorithm Row-Diagonal Parity (RDP) for the propose of protecting against double disk failures. It stores all unencoded data and uses only the entire operation during construction and reconstruction to computational complexity. RDP works in individual stripe blocks commonly used in file systems, disk arrays, and databases. In the information column, use parity lines of a different slope, or slopes, to obtain a check column. The code word of an EVENODD code is placed in an array of (m-1)*(m+2), where m is a prime number, where the information is set in an array of (m-1)*m, and the last two columns are the parity information characters. Two columns of parity bits are XOR by the information bits in the same row or on the diagonal of a given slope. The layout strategy using EVENODD coding algorithm can allow two data blocks to error at the same time, which can ensure the stability of the system. It has been widely used in technologies such as RAID (Redundant Arrays of Independent Disks).A fast repair algorithm is proposed the check disk failure repair problem in distributed storage systems based on RAID 6 encoding. This paper proposed a fast repair algorithm. Through the theoretical analysis of RDP and EVENODD encoding, the node's computational encoding capability is used to transfer encoded data blocks to repair the checksum disk, which reduces the data transfer during the repair process and shortens the repair time. The theoretical analysis shows that this algorithm can significantly reduce the bandwidth resources consumed during the check disk failure repair process and improve the repair efficiency compared to traditional repair algorithms.