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
Fault-Tolerant Multi-Server Video-on-Demand Service
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Stable Checkpointing in Distributed Systems without Shared Disks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
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
Data consistent up- and downstreaming in a distributed storage system
SNAPI '03 Proceedings of the international workshop on Storage network architecture and parallel I/Os
SNAPI '03 Proceedings of the international workshop on Storage network architecture and parallel I/Os
Failure-tolerant distributed storage with compressed (1 out-of N) codes
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Fault-tolerant data layouts for storage systems are based on the principle to add redundancy to groups of data blocks and store them in different fault regions. Commonly, XOR-based codes are used with an optimal redundancy overhead but with the disadvantage of relatively high calculation costs. We present a scheme that encodes input data in a highly redundant code and exploits that redundancy for a fault tolerance scheme. It allows to recalculate missed bits in fewer steps than needed for XOR-based schemes. This simple and efficient en- and decoding requires an appropriate hardware architecture or a highly parallel microprocessor architecture. Particularly, disjunctions over many input bits must be calculated, e.g. by wide OR-gates or busses that are driven by multiple logic input lines. The high redundant encoding is combined with data compression for separated data streams, each stream dedicated to a storage device. The compression not only eliminates the introduced redundancy of the used code, it also eliminates redundancy in the input data.