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
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
| 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. Ordering the edges so that no more than f check disks (vertices) appear among any set of d consecutive edges is found to optimize access performance of the disk array when d is maximized. These cluttered orderings are examined for the complete graph Kn. The maximum number d of edges is determined precisely when f ≤ 5 and when f = n - 1, and bounds are derived in the remaining cases.