A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Coding Techniques for Handling Failures in Large Disk Arrays
Coding Techniques for Handling Failures in Large Disk Arrays
Adaptive cross-parity (AXP) code for a high-density magnetic tape subsystem
IBM Journal of Research and Development - High-density magnetic recording
Deterministic Voting in Distributed Systems Using Error-Correcting Codes
IEEE Transactions on Parallel and Distributed Systems
Coding for High Availability of a Distributed-Parallel Storage System
IEEE Transactions on Parallel and Distributed Systems
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Computing in the RAIN: A Reliable Array of Independent Nodes
IEEE Transactions on Parallel and Distributed Systems
Ordering disks for double erasure codes
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Reliability and performance of hierarchical RAID with multiple controllers
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Concurrent Updates on Striped Data Streams in Clustered Server Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Computing in the RAIN: A Reliable Array of Independent Nodes
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A cost effective fault-tolerant scheme for RAIDs
Journal of Computer Science and Technology
A multiple disk failure recovery scheme in RAID systems
Journal of Systems Architecture: the EUROMICRO Journal
IEEE Transactions on Computers
Selecting RAID Levels for Disk Arrays
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Hydra: a platform for survivable and secure data storage systems
Proceedings of the 2005 ACM workshop on Storage security and survivability
Multi-level RAID for very large disk arrays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Reliability of modular mesh-connected intelligent storage brick systems
IBM Journal of Research and Development
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
Reliability mechanisms for file systems using non-volatile memory as a metadata store
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Mirrored Disk Organization Reliability Analysis
IEEE Transactions on Computers
Failed disk recovery in double erasure RAID arrays
Journal of Discrete Algorithms
Matrix methods for lost data reconstruction in erasure codes
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
STAR: an efficient coding scheme for correcting triple storage node failures
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
WEAVER codes: highly fault tolerant erasure codes for storage systems
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays
IEEE Transactions on Computers
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Performance evaluation of RAID6 systems
FAST '07 Proceedings of the 5th USENIX conference on File and Storage Technologies
Uncomplicated recovering algorithm based on dual parity placement scheme in disk array systems
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
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
ACM Transactions on Storage (TOS)
A self-balancing striping scheme for NAND-flash storage systems
Proceedings of the 2008 ACM symposium on Applied computing
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Failure-tolerant distributed storage with compressed (1 out-of N) codes
Journal of Systems Architecture: the EUROMICRO Journal
Prefetching with adaptive cache culling for striped disk arrays
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Undetected disk errors in RAID arrays
IBM Journal of Research and Development
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
The Journal of Supercomputing
A performance evaluation and examination of open-source erasure coding libraries for storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
P-Code: a new RAID-6 code with optimal properties
Proceedings of the 23rd international conference on Supercomputing
International Journal of High Performance Computing Applications
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Toward optimizing Cauchy matrix for Cauchy Reed-Solomon code
IEEE Communications Letters
Shortening array codes and the perfect 1-factorization conjecture
IEEE Transactions on Information Theory
DiskReduce: RAID for data-intensive scalable computing
Proceedings of the 4th Annual Workshop on Petascale Data Storage
T-code: 3-erasure longest lowest-density MDS codes
IEEE Journal on Selected Areas in Communications
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
FPGA-accelerated deletion-tolerant coding for reliable distributed storage
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
Reliability and performance enhancement technique for SSD array storage system using RAID mechanism
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Optimal recovery of single disk failure in RDP code storage systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A new class of MDS erasure codes based on graphs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
EEO: an efficient MDS-like RAID-6 code for parallel implementation
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Rotary-code: Efficient MDS array codes for RAID-6 disk arrays
WSEAS Transactions on Computers
Network coding for distributed storage systems
IEEE Transactions on Information Theory
Construction of efficient or-based deletion-tolerant coding schemes
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ACM Transactions on Storage (TOS)
Online availability upgrades for parity-based RAIDs through supplementary parity augmentations
ACM Transactions on Storage (TOS)
Disk Scrubbing Versus Intradisk Redundancy for RAID Storage Systems
ACM Transactions on Storage (TOS)
Selecting RAID levels for disk arrays
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
RAID level selection for heterogeneous disk arrays
Cluster Computing
A Hybrid Approach to Failed Disk Recovery Using RAID-6 Codes: Algorithms and Performance Evaluation
ACM Transactions on Storage (TOS)
ACM Transactions on Embedded Computing Systems (TECS)
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Rebuild processing in RAID5 with emphasis on the supplementary parity augmentation method[37]
ACM SIGARCH Computer Architecture News
Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array
ACM Transactions on Storage (TOS)
ACM Transactions on Storage (TOS)
What can coding theory do for storage systems?
ACM SIGACT News
Exploiting Redundancies and Deferred Writes to Conserve Energy in Erasure-Coded Storage Clusters
ACM Transactions on Storage (TOS)
Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
ACM Transactions on Storage (TOS)
Modeling the aging process of flash storage by leveraging semantic I/O
Future Generation Computer Systems
SD codes: erasure codes designed for how storage systems really fail
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
Screaming fast Galois field arithmetic using intel SIMD instructions
FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 0.14 |
We present a novel method, that we call EVENODD, for tolerating up to two disk failures in RAID architectures. EVENODD employs the addition of only two redundant disks and consists of simple exclusive-OR computations. This redundant storage is optimal, in the sense that two failed disks cannot be retrieved with less than two redundant disks. A major advantage of EVENODD is that it only requires parity hardware, which is typically present in standard RAID-5 controllers. Hence, EVENODD can be implemented on standard RAID-5 controllers without any hardware changes. The most commonly used scheme that employes optimal redundant storage (i.e., two extra disks) is based on Reed驴Solomon (RS) error-correcting codes. This scheme requires computation over finite fields and results in a more complex implementation. For example, we show that the complexity of implementing EVENODD in a disk array with 15 disks is about 50% of the one required when using the RS scheme. The new scheme is not limited to RAID architectures: it can be used in any system requiring large symbols and relatively short codes, for instance, in multitrack magnetic recording. To this end, we also present a decoding algorithm for one column (track) in error.Index Terms驴RAID architectures, erasure-correcting codes, Reed驴Solomon codes, disk arrays.