Study of graph decompositions and placement of parity and data to tolerate two failures in disk arrays: Conditions and existence

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 26, Issue 10, 2003, Pages 1379-1386

  Zhou, Jie ^a   Wang, Gang ^b   Liu, Xiao Guang ^b   Liu, Jing ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b NANKAI UNIVERSITY   (China)

Author keywords

partition of a check group; Check group; Close path; Graph of check group; Recoverable forest

Indexed keywords

ARRAYS; DATA STORAGE EQUIPMENT; RELIABILITY;

CHECK GROUP; CLOSE PATH; GRAPH OF CHECK GROUP; RECOVERABLE FOREST; REDUNDANT ARRAY OF INDEPENDENT DISK;

MAGNETIC DISK STORAGE;

EID: 1642453872     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Katz R H, Gibson G A, Patterson D A. Disk system architecture for high performance computing. IEEE Proceedings, 1989, 77(12): 1842-1858.
2. Blaum M, Brady J, Bruck J, Menon J. EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computing, 1995, 44(2): 192-202.
3. Lee E K, Katz R H. The performance of parity placements in disk arrays. IEEE Transactions on Computing, 1993, 42(6): 651-664.
4. Thomas J E Schwarz, Steinberg J, Burkhard W A. Permutation Development Data Layout (PDDL) disk array declustering. In: Proceedings of HPCA'99, Orlando, 1999. 214-217.
5. Hellerstein L, Gibson G A, Karp R M, Patterson D A. Coding techniques for handling failures in large disk arrays. Algorithmica, 1994, 12(3-4): 182-208.
6. Ng S W. Crosshatch disk array for improved reliability and performance. In: Proceedings of International Symposium on Computer Architecture, Chicago, 1994. 255-264.
7. Park C. Efficient placement of parity and data to tolerate two disk failures in disk array systems. IEEE Transactions on Parallel and Distribute Systems, 1995, 6(11): 1177-1184.
8. Park C, Choe T Y. Striping in disk arrays RM2 enabling the tolerance of double disk failures. http://www.supercomp.org/sc96/proceedings/sc96PROC/CIPARK/INDEX.HTM.
9. Lee N K, Yang S B, Lee K W. Efficient parity placement schemes for tolerating up to two disk failures in disk arrays. Journal of Systems Architecture, 2000, 46(15): 1383-1402.
10. Bondy J A, Murty U S R. Graph Theory With Applications. London: The Macmillan Press Ltd., 1976.
11. MacWilliams F J, Sloane N J A. The Theory of Error-correcting Codes. Amsterdam: North-Holland, 1977.
12. Zhou Jie, Liu Xiao-Guang, Wang Gang, Liu Jing. Data parity and mirror layout for tolerating two disk failures in disk array. Computer Engineering and Applications, 2002, 38(18): 82-85 (in Chinese)