Binary random systematic erasure code for RAID system
Teng Pengguo, Xiaojing Wang, Liang Chen, De-zhai Yuan · AIP conference proceedings · 2017
As the increasing expansion of data scale, storage systems grow in size and complexity, the requirements for systems scalability and methodologies to recover simultaneous disk and sector failures are inevitable. To ensure high reliability and flexible scalability, erasure codes with high fault tolerance and flexibility are required. In this pa per, we present a class of erasure codes satisfied the previous requirements, which referred as Binary Random Systematic erasure code, called BRS code for short. BRS code constructs its generator matrix based on random matrix, whose elements are in Galois Field GF (2), and takes the advantage of exclusive-or (XOR) operations to make it work much fast. It is designed as a systematic code to facilitate the store and recovery. Moreover, δ random redundancies make the probability of successfully decoding controllable. Our evaluations and experiments show that BRS code is flexible on parameters and fault tolerance setting, and has high computing efficiency on encoding and decoding speeds, what is more, when the code length is long enough, BRS code is approximately MDS, thus make it have nearly optimal storage efficiency.