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
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
Asymptotically optimal erasure-resilient codes for large disk arrays
Discrete Applied Mathematics - Coding, cryptography and computer security
Ordering disks for double erasure codes
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
An Introduction to Error Correcting Codes with Applications
An Introduction to Error Correcting Codes with Applications
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
Cluttered orderings for the complete bipartite graph
Discrete Applied Mathematics
| Hi-index | 0.00 |
In a systematic erasure code for the correction of two simultaneous erasures, each information symbol must have two associated parity symbols. When implemented in a redundant array of independent disks (RAID), performance requirements on the update penalty necessitate that each information symbol be associated with no more parity symbols than the two required. This leads to a simple graph model of the erasure codes, with parity symbols as vertices and information symbols as edges. Based on simulations of RAID performance, an ordering of the edges in which every sequence of three consecutive edges in the order induces as few vertices as possible is found to optimize access performance of the disk array. The ladder orderings to optimize performance are shown to exist for the complete graph Kn, except possibly when n ∈ {15, 18, 22}.