Redundant disk arrays: reliable, parallel secondary storage
Redundant disk arrays: reliable, parallel secondary storage
A new class of group divisible designs with block size three
Journal of Combinatorial Theory Series A
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
An Introduction to Error Correcting Codes with Applications
An Introduction to Error Correcting Codes with Applications
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
On the Pósa-Seymour conjecture
Journal of Graph Theory
Ordering disks for double erasure codes
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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)
Cluttered orderings for the complete bipartite graph
Discrete Applied Mathematics
Cluttered orderings for the complete bipartite graph
Discrete Applied Mathematics
Ladder orderings of pairs and RAID performance
Discrete Applied Mathematics
A highly reliable and parallelizable data distribution scheme for data grids
Future Generation Computer Systems
| Hi-index | 0.00 |
Steiner triple systems are well studied combinatorial designs that have been shown to possess properties desirable for the construction of multiple erasure codes in RAID architectures. The ordering of the columns in the parity check matrices of these codes affects system performance. Combinatorial problems involved in the generation of good and bad column orderings are defined, and examined for small numbers of accesses to consecutive data blocks in the disk array.