A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Performance analysis of disk arrays under failure
Proceedings of the sixteenth international conference on Very large databases
Distributed sparing in disk arrays
COMPCON '92 Proceedings of the thirty-seventh international conference on COMPCON
Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation
IEEE Transactions on Computers
RAID5 Performance with Distributed Sparing
IEEE Transactions on Parallel and Distributed Systems
Reconstruct versus read-modify writes in RAID
Information Processing Letters
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Reconstruct versus read-modify writes in RAID
Information Processing Letters
Why specialized disks for composite operations may be unnecessary
ACM SIGARCH Computer Architecture News
Rebuild processing in RAID5 with emphasis on the supplementary parity augmentation method[37]
ACM SIGARCH Computer Architecture News
| Hi-index | 14.99 |
Several new disk arrays have recently been proposed in which the parity groupings are uniformly distributed throughout the array so that the extra workload created by a disk failure can be evenly shared by all the surviving disks, resulting in the best possible degraded mode performance. Many arrays now also put in multiple spare disks so that expensive service calls can be deferred. Furthermore, in a new sparing scheme called distributed sparing, the spare spaces are actually distributed throughout the array. This means after a rebuild the new array will be logically different from the original array. The authors present an algorithm for constructing and maintaining arrays with distributed sparing so that repeated uniform parity group distribution is achieved with each successive failure.