A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
Performance consequences of parity placement in disk arrays
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
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
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Architectures and algorithms for on-line failure recovery in redundant disk arrays
Distributed and Parallel Databases - Special issue on disk arrays
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Flexible usage of parity storage space in disk arrays
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Improved parity-declustered layouts for disk arrays
Journal of Computer and System Sciences
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
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation
IEEE Transactions on Computers
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
| Hi-index | 0.01 |
A new layout method Prime-groups is proposed to evenly distribute parity groups for declustered RAID. Prime-groups satisfies most of the layout goals for a good declustered RAID layout. For the goals that are not satisfied, it is near optimal. A new layout goal maximal write and reconstruction parallelism is also proposed. If a layout satisfies the new goal, all the surviving disks can be read in parallel and can be rewritten in parallel during reconstruction and reconfiguration. Prime-groups satisfies the new goal when the write request begins in the first disk of the array. It is also near optimal in term of declustering ratio when ip is a prime. Prime-groups can compliment the layouts proposed by Alvarez et al. [2] for the criteria to obtain a good layout is quite different between Prime-groups and those proposed by Alvarez et al. [2].