EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems
Software—Practice & Experience
IEEE Transactions on Computers
Searchable Compressed Representations of Very Sparse Bitmaps (extended abstract)
DCC '03 Proceedings of the Conference on Data Compression
An XOR Based Reed-Solomon Algorithm for Advanced RAID Systems
DFT '04 Proceedings of the Defect and Fault Tolerance in VLSI Systems, 19th IEEE International Symposium
Distributed Storage with Compressed (1 out-of N) Codes
PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing
Construction of efficient or-based deletion-tolerant coding schemes
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Bitmap indexes for large scientific data sets: a case study
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Deletion-tolerant codes provide data availability despite storage failures and are commonly used for disk arrays and reliable storage in distributed systems. The codes used for that base on binary parity or on sophisticated cyclic codes with minimal storage overhead. But the calculations for these codes cause either a noticeable number of computation cycles or require a huge number of logic gates. In this paper, a different class of deletion-tolerant codes - compressed (1 out-of N) codes - are analyzed with a focus on their application for distributed storage systems. It is shown that these codes when combined with compression can provide nearly the same low storage overhead as the traditional codes and allow a proper parallelization. Several variants of the code within the design space are discussed. A projection of the (1 out-of N) coding principle to a distributed protocol across storage units shows that the compression effort can be hidden in the communication and storage principles.