A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Failure correction techniques for large disk arrays
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Introduction to algorithms
Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Architectures and algorithms for on-line failure recovery in redundant disk arrays
Distributed and Parallel Databases - Special issue on disk arrays
Segmented information dispersal (SID) for efficient reconstruction in fault-tolerant video servers
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering
Proceedings of the 24th annual international symposium on Computer architecture
Declustered disk array architectures with optimal and near-optimal parallelism
Proceedings of the 25th annual international symposium on Computer architecture
Segmented Information Dispersal (SID) Data Layouts for Digital Video Servers
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Recently, parity-declustered layouts have been studied as a tool for reducing the time needed to reconstruct a failed disk in a disk array [5, 9]. Construction of such layouts for large disk arrays generally involves the use of a balanced incomplete block design (BIBD), a type of subset system over the set of disks. This research has been somewhat hampered by the dearth of general results and constructions for BIBDs on large sets, and by inefficiencies in some parity-distribution methods that create layouts that are larger than necessary. We make progress on these problems in several ways. In particular, we •Demonstrate a new BIBD construction that generalizes some previous constructions and yields a simpler BIBD that is optimally small in some cases.•Show how relaxing some of the balance constraints on data layouts leads to constructions of approximately-balanced layouts that greatly increase the number of feasible layouts for large arrays.•Give a new method for distributing parity that produces smaller data layouts, resulting in tight bounds on the size of the data layouts derived from BIBDs.Our results use a variety of algebraic, combinatorial, and graph-theoretic techniques, and together greatly increase the number of parity-declustered data layouts that are appropriate for use in large disk arrays.