Efficient parity placement schemes for tolerating up to two disk failures in disk arrays

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal-horizontal) and DH2 schemes, are presented. Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. DH1 scheme can reduce the occurrences of the bottleneck problem significantly because the parity blocks are evenly distributed throughout the disk array. DH2 scheme uses one more disk than DH1 scheme in order to store the horizontal parities, while the diagonal parities are placed in the same way as in DH1 scheme with a minor change. Even though both DH schemes use almost optimal disk space for storing the redundant information, the encoding algorithms for them are quite simple and efficient. Moreover, both DH schemes can recover rapidly from any two disk failures.

Original languageEnglish
Pages (from-to)1383-1402
Number of pages20
JournalJournal of Systems Architecture
Volume46
Issue number15
DOIs
Publication statusPublished - 2000 Dec 31

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture

Cite this

@article{120a4c0916d84b13b03c2409e0619481,
title = "Efficient parity placement schemes for tolerating up to two disk failures in disk arrays",
abstract = "In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal-horizontal) and DH2 schemes, are presented. Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. DH1 scheme can reduce the occurrences of the bottleneck problem significantly because the parity blocks are evenly distributed throughout the disk array. DH2 scheme uses one more disk than DH1 scheme in order to store the horizontal parities, while the diagonal parities are placed in the same way as in DH1 scheme with a minor change. Even though both DH schemes use almost optimal disk space for storing the redundant information, the encoding algorithms for them are quite simple and efficient. Moreover, both DH schemes can recover rapidly from any two disk failures.",
author = "Lee, {Nam Kyu} and Sung-Bong Yang and Kyoungwoo Lee",
year = "2000",
month = "12",
day = "31",
doi = "10.1016/S1383-7621(00)00031-X",
language = "English",
volume = "46",
pages = "1383--1402",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "15",

}

Efficient parity placement schemes for tolerating up to two disk failures in disk arrays. / Lee, Nam Kyu; Yang, Sung-Bong; Lee, Kyoungwoo.

In: Journal of Systems Architecture, Vol. 46, No. 15, 31.12.2000, p. 1383-1402.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient parity placement schemes for tolerating up to two disk failures in disk arrays

AU - Lee, Nam Kyu

AU - Yang, Sung-Bong

AU - Lee, Kyoungwoo

PY - 2000/12/31

Y1 - 2000/12/31

N2 - In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal-horizontal) and DH2 schemes, are presented. Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. DH1 scheme can reduce the occurrences of the bottleneck problem significantly because the parity blocks are evenly distributed throughout the disk array. DH2 scheme uses one more disk than DH1 scheme in order to store the horizontal parities, while the diagonal parities are placed in the same way as in DH1 scheme with a minor change. Even though both DH schemes use almost optimal disk space for storing the redundant information, the encoding algorithms for them are quite simple and efficient. Moreover, both DH schemes can recover rapidly from any two disk failures.

AB - In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal-horizontal) and DH2 schemes, are presented. Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. DH1 scheme can reduce the occurrences of the bottleneck problem significantly because the parity blocks are evenly distributed throughout the disk array. DH2 scheme uses one more disk than DH1 scheme in order to store the horizontal parities, while the diagonal parities are placed in the same way as in DH1 scheme with a minor change. Even though both DH schemes use almost optimal disk space for storing the redundant information, the encoding algorithms for them are quite simple and efficient. Moreover, both DH schemes can recover rapidly from any two disk failures.

UR - http://www.scopus.com/inward/record.url?scp=0034500115&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034500115&partnerID=8YFLogxK

U2 - 10.1016/S1383-7621(00)00031-X

DO - 10.1016/S1383-7621(00)00031-X

M3 - Article

AN - SCOPUS:0034500115

VL - 46

SP - 1383

EP - 1402

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 15

ER -