The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—In this paper, we deal with the data/parity placement problem which is described as follows: how to place data and parity evenly across disks in order to tolerate two disk failures, given the number of disks <it>N</it> and the redundancy rate <it>p</it> which represents the amount of disk spaces to store parity information. To begin with, we transform the data/parity placement problem into the problem of constructing an <it>N</it>×<it>N</it> matrix such that the matrix will correspond to a solution to the problem. The method to construct a matrix has been proposed and we have shown how our method works through several illustrative examples. It is also shown that any matrix constructed by our proposed method can be mapped into a solution to the placement problem if a certain condition holds between <it>N</it> and <it>p</it> where <it>N</it> is the number of disks and <it>p</it> is a redundancy rate.</p>
Data protection, disk array, disk failures, I/O performance, parity placement.
Chan-Ik Park, "Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 1177-1184, November 1995, doi:10.1109/71.476189
93 ms
(Ver 3.1 (10032016))