Redundant disk arrays: reliable, parallel secondary storage
Redundant disk arrays: reliable, parallel secondary storage
Parity logging overcoming the small write problem in redundant disk arrays
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
On-line data reconstruction in redundant disk arrays
On-line data reconstruction in redundant disk arrays
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
File-Access Characteristics of Parallel Scientific Workloads
IEEE Transactions on Parallel and Distributed Systems
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering
Proceedings of the 24th annual international symposium on Computer architecture
Asymptotically optimal erasure-resilient codes for large disk arrays
Discrete Applied Mathematics - Coding, cryptography and computer security
An Introduction to Error Correcting Codes with Applications
An Introduction to Error Correcting Codes with Applications
Proceedings of the Second International Conference on Data Engineering
Optimal and pessimal orderings of Steiner triple systems in disk arrays
Theoretical Computer Science - Latin American theoretical informatics
Software and Performance Issues in the Implementation of a RAID
Software and Performance Issues in the Implementation of a RAID
Performance modeling and analysis of disk arrays
Performance modeling and analysis of disk arrays
Low-density MDS codes and factors of complete graphs
IEEE Transactions on Information Theory
Cluttered Orderings for the Complete Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Ladder orderings of pairs and RAID performance
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Cyclic Storage for Fault-Tolerant Distributed Executions
IEEE Transactions on Parallel and Distributed Systems
Ladder orderings of pairs and RAID performance
Discrete Applied Mathematics
| Hi-index | 0.00 |
Dish arrays have been designed with two competing goals in mind, the ability to reconstruct erased disks (reliability), and the speed with which information can be read, written, and reconstructed (performance). The substantial loss in performance of write operations as reliability requirements increase has resulted in an emphasis on performance at the expense of reliability. This has proved acceptable given the relatively small members of disks in current disk arrays. We develop a method for improving the performance of write operations in disk arrays capable of correcting any double erasure, by ordering the columns of the erasure code to minimize the amount of parity information that requires updating. For large disk arrays, this affords a method to support the reliability needed without the generally accepted loss of performance.