A Lower Bound on Disk Reads for Single Information Disk Failure Recovery and One Recovery Scheme for EVENODD(p, 3)

Abstract

EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.