Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 11, 1995, Pages 1177-1184

  Park, Chan Ik ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Data protection; disk array; disk failures; I O performance; parity placement

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; MAGNETIC DISK STORAGE; MATRIX ALGEBRA; PROBLEM SOLVING; SECURITY OF DATA;

DATA/PARITY PLACEMENT PROBLEM; DISK ARRAY SYSTEMS; DISK FAILURES; REDUNDANCY RATE;

PARALLEL PROCESSING SYSTEMS;

EID: 0029403638     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.476189     Document Type: Article

References (18)

1. P.C. Dibble, “A Parallel interleaved file system,” Computer Science, Tech. Report 334, Univ. of Rochester, Mar. 1990.
2. S. Frey, “DATACUBE distributed system,” IBM Los Angeles Scientific Center, Mar. 1991.
3. G. Gibson, et al., “ Coding techniques for handling failures in large disk arrays Computer Science Tech. Report CSD88-477, Univ. of California, Berkeley, Dec. 1988.
4. G. Gibson, “Redundant disk atrays; Reliable, parallel secondary storage,” PhD dissertation, Univ. of California at Berkeley, Dec. 1990.
5. R.H. Katz, G.A. Gibson, and D.A. Patterson, “Disk system architectures for high performance computing,” Proc. IEEE, vol. 77, no. 12, pp. 1,842-1,858, Dec. 1,989.
6. M.Y. Kim, “Synchronized disk interleaving,” IEEE Trans. Computers, vol. 35, no. 11, pp. 978-988, Nov. 1986.
7. H.T. Kung, “Memory requirements for balanced computer architectures,” Proc. 13th Ann Int'l Symp. Computer Architecture, pp. 49-54, 1986.
8. E.K. Lee and R.H. Katz, “Performance consequences of parity placement in disk arrays,” Proc. Fourth ACM Arch. Supp. Prog. Lang. Oper. Syst., Santa Clara, Calif., pp. 190-199, 1990.
9. E. K. Lee and Randy H. Katz, “The performance of parity placements in disk arrays,” IEEE Trans. Computers, vol. 42, no. 6, 651-664 June 1993.
10. S.W. Ng, “Sparing for a redundant disk array,” IBM Research Report RJ 7621, 1990.
11. C.-I. Park, “Comparison of MTTF of various coding techniques in disk arrays,” internal memo, System Software Lab., Dept. of Computer Science, POSTECH, 1992.
12. A.M. Patel, “Error and failure-control procedure for a large-size bubble memory,” IEEE Trans. Magnetics, vol. 18, no. 6, pp. 1,319-1,3211982.
13. D.A. Patterson, G. Gibson, and R.H. Katz, “A Case for redundant arrays of inexpensive disks (RAID),” Proc. ACM SIGMOD Conf., Chicago, pp. 109-116, 1988.
14. D.A. Patterson, et al., “Introduction to redundant arrays of inexpensive disks (RAID),” Computer Science Report CSD88-479, Univ. of Calif. Berkeley, 1988.
15. W.W. Peterson and E.J. Weldon Jr., Error-Correcting Codes, MIT Press, 1972.
16. A.L.N. Reddy and P. Banerjee “An evaluation of multiple-disk I/O systems,” IEEE Trans. Computers, vol. 38, no. 12, pp. 1,680-1,690, Dec. 1989.
17. A.L.N. Reddy and P. Banerjee, “Gracefully degradable disk arrays,” Proc. FTCS. pp. 401-408, 1991.
18. K. Salem and H. Garcia-Molina, “Disk striping,” Proc. Int'l Conf. Data Eng., pp. 336-342, 1986.