Open AccessResearch on Multi-fault-tolerant MDS Array Erasure code
Author(s) -
Yuan Wei,
Ying Yu,
Guanghui Yan,
Dan Tang
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1237/2/022015
Subject(s) - computer science , fault tolerance , erasure code , constant weight code , systematic code , code (set theory) , redundant code , unreachable code , parallel computing , decoding methods , computer hardware , distributed computing , code generation , code rate , algorithm , concatenated error correction code , operating system , programming language , key (lock) , block code , set (abstract data type)
The array code has the advantages of high computational efficiency and simple structure. And the erasure code strategy based on the array code is one of the ideal fault-tolerant methods for distributed storage systems. However, low fault tolerance has always been a major obstacle to the practicality of array code. According to the known literature, the fault-tolerance of MDS array code is no more than three. And the array code with the biggest fault tolerance is the Grid code. Its fault tolerance is usually only 15. In view of this situation, this paper proposes a kind of multi-fault-tolerant MDS array code, called Reed-Solomon Array (RA). The RA code has higher coding efficiency, whose encoding process and decoding process only involve binary XOR operations. What is more, the construction method is simple and easy to be implemented by software and hardware. And then the RA code is a MDS code with optimal storage efficiency. Finally the size of the storage array of the RA code is not strictly limited. The extensibility of the distributed storage system is met.