The Study of Graph Decompositions and Placement of Parity and Data to Tolerate Two Failures in Disk Arrays: Conditions and Existance
Jie Zhou · Chinese Journal of Computers · 2003
A novel method for tolerating up to two disk failures in disk arrays has been presented. By representing a check group consisting of date and parity units with a graph, the conditions for tolerating two disk failures in disk arrays becomes to that of partitions of check group, and thus to that of the decompositions of its graph. A necessary and sufficient condition for the partition of check group is proved; the existence of the partition is given; the condition for optimizing the performance of the placement scheme is discussed; and the step of placement of the date and parity in a disk array is shown. It presents an efficient method for placement schemes with optimizing performance to tolerating two disk failures in disk arrays.