An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Failure-tolerant distributed storage with compressed (1 out-of N) codes
Journal of Systems Architecture: the EUROMICRO Journal
The Journal of Supercomputing
Construction of efficient or-based deletion-tolerant coding schemes
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
CEA: A Cyclic Expansion Algorithm for data migration in parallel video servers
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper, a simple codec algorithm based on Reed-Solomon (RS) codes is proposed for erasure correcting in RAID (Redundant Array of Independent Disks) level 6 systems. Unlike conventional RS codes, here this scheme with a mathematical reduction method, called Reduced Static-Checksum Table Approach, could improve coding performance, including encoding and decoding procedures. This scheme uses current industrial RAID-5 controllers as well as the regular hardware only and without extra cost in adding any new equipment. Moreover, our algorithm is able to expand to correct multiple failed-disks while others,EvenOdd codes for example, cannot do so. Also, this scheme performs all computations with only simple exclusive-OR (XOR) operators as same as EvenOdd codes. For most RAID architectures, this new XOR-based RS code could adapt to implementation in terms of reliability, flexibility and lower cost.