Uniform Parity Group Distribution in Disk Arrays with Multiple Failures

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. >

[1]  Prithviraj Banerjee,et al.  Gracefully degradable disk arrays , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

[2]  D. Raghavarao.  Constructions and Combinatorial Problems in Design of Experiments , 1971 .

[3]  R. Mead,et al.  The Design of Experiments , 1989 .

[4]  John C. S. Lui,et al.  Performance Analysis of Disk Arrays under Failure , 1990, VLDB.

[5]  Spencer Ng,et al.  Some design issues of disk arrays , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[6]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[7]  J. Menon,et al.  Distributed sparing in disk arrays , 1992, Digest of Papers COMPCON Spring 1992.

[8]  Spencer W. Ng,et al.  Maintaining good performance in disk arrays during failure via uniform parity group distribution , 1992, Proceedings of the First International Symposium on High-Performance Distributed Computing. (HPDC-1).

[9]  R. Mead,et al.  The Design of Experiments. , 1989 .