RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
A Performance Evaluation of RAID Architectures
IEEE Transactions on Computers
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
RAID5 Performance with Distributed Sparing
IEEE Transactions on Parallel and Distributed Systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Mirrored disk rouing and scheduling
Cluster Computing
Reliability and Performance of Mirrored Disk Organizations
The Computer Journal
Performance of Two-Disk Failure-Tolerant Disk Arrays
IEEE Transactions on Computers
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Reliability analysis of deduplicated and erasure-coded storage
ACM SIGMETRICS Performance Evaluation Review
RAID level selection for heterogeneous disk arrays
Cluster Computing
A highly reliable and parallelizable data distribution scheme for data grids
Future Generation Computer Systems
Effect of codeword placement on the reliability of erasure coded data storage systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 14.98 |
Disk mirroring or RAID level 1 (RAID1) is a popular paradigm to achieve fault tolerance and a higher disk access bandwidth for read requests. We consider four RAID1 organizations: basic mirroring, group rotate declustering, interleaved declustering, and chained declustering, where the last three organizations attain a more balanced load than basic mirroring when disk failures occur. We first obtain the number of configurations, A(n, i), which do not result in data loss when i out of n disks have failed. The probability of no data loss in this case is A(n,i)/{n \choose i}. The reliability of each RAID1 organization is the summation over 1 \leq i \leq n/2 of A(n, i) r^{n-i}(1-r)^{i}, where r denotes the reliability of each disk. A closed-form expression for A(n,i) is obtained easily for the first three organizations. We present a relatively simple derivation of the expression for A(n,i) for the chained declustering method, which includes a correctness proof. We also discuss the routing of read requests to balance disk loads, especially when there are disk failures, to maximize the attainable throughput.