Special paperEvaluating approximately balanced parity-declustered data layouts for disk arrays☆
References (22)
- et al.
Fast probabilistic algorithms for Hamiltonian circuits and matchings
J. Comput. Syst. Sci.
(1979) Balanced incomplete block designs and related designs
Discrete Math.
(1975)- et al.
measurements of a distributed file system
On the construction of balanced incomplete block designs
Ann. Eugenics
(1939)- et al.
Maximizing performance in a striped disk array
- et al.
Stochastic relaxation, Gibbs distributions and the Bayes restoration of images
IEEE Trans. Pattern Anal. Mach. Intell.
(1984) - et al.
Coding techniques for handling failures in large disk arrays
Algorithmica
(1994) - M. Holland, personal communication,...
- et al.
Parity declustering for continuous operation in redundant disk arrays
- et al.
Architectures and algorithms for on-line failure recovery in redundant disk arrays
J. Distrib. Parallel Databases
(1994)
IBM 0661 Disk Drive Product Description, Model 370
Cited by (6)
Optimizing large data transfers in parity-declustered data layouts
2015, Journal of Computer and System SciencesCitation Excerpt :If an array must remain available during the reconstruction of lost data, or must be taken off-line for as little time as possible for the purpose of failure recovery, it may be desirable to dedicate more space to redundant information if it allows failure recovery to be completed more quickly. This tradeoff of additional redundant space for reduced failure recovery time can be achieved using a technique called parity declustering, in which the stripe size k is chosen to be smaller than the array size v. Parity-declustered data layouts have been considered by, among others, Muntz and Lui [12], Holland and Gibson [10], Stockmeyer [20], Schwabe and Sutherland [16,18], Schwabe, Sutherland, and Holmer [19], Alvarez, Burkhard, and Cristian [1], and Alvarez, Burkhard, Stockmeyer, and Cristian [2]. A parity-declustered data layout is a single-fault-tolerant systematic array code in which more than one disk's worth of space is dedicated to redundant information.
An optimal workload-based data allocation approach for multidisk databases
2009, Data and Knowledge EngineeringConstructing double- And triple-erasure-correcting codes with high availability using mirroring and parity approaches
2007, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADSA double-objective genetic algorithm for parity declustering optimization in networked RAID
2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Parity declustering data layout for tolerating dependent disk failures in network RAID systems
2002, Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002Flexible usage of redundancy in disk arrays
1999, Theory of Computing Systems
- ☆
A preliminary version of this paper appears in the Proceedings of the Fourth Annual Workshop on I/O in Parallel and Distributed Systems, pp. 41–54, May 1996.
- 2
Supported by NSF Grant CCR-9309111.
- 3
Supported by the National Science Foundation under grant CCR-9309111.
- 4
This research was performed while the author was with the Department of EECS, Northwestern University, and was supported by NSF Grant MIP-9210692.