Reliability and performance of disk arrays

Introduction of redundancy into secondary storage systems in the form of Redundant Arrays of Independent Disks (RAIDs) has generated both research activity and commercial applications. The thesis investigates the performance and reliability of RAIDs analytically. We give exact Markov models to derive reliability results. We use queuing network methods to calculate RAID performance in the failure free and post-failure states. We prove the necessity of non-volatile storage through the evaluation of synchronized write protocols. In addition to Level 5 RAIDs with and without spares, we treat higher redundancy extensions of the Level 5 RAID: two-dimensional RAIDs and disk arrays based on Maximum Distance Separable (MDS) codes. We define and investigate a string sensitive declustering scheme, the Almost Complete Address Translation Scheme (ACATS). Finally, we extend the use of MDS codes to implement a storage space saving distributed database.

[1]  M. Blaum A coding technique for recovery against double disk failures in disk arrays , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[2]  Randy H. Katz,et al.  How reliable is a RAID? , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[3]  Jai Menon,et al.  Performance of disk arrays in transaction processing environments , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[4]  Walter A. Burkhard,et al.  The Gemini replicated-file system testbed , 1989, Inf. Sci..

[5]  Garth A. Gibson Redundant disk arrays: Reliable, parallel secondary storage. Ph.D. Thesis , 1990 .

[6]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[7]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[8]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[9]  R. M. Capocelli Sequences: combinatorics, compression, security, and transmission , 1990 .

[10]  Khaled A. S. Abdel-Ghaffar,et al.  An Optimal Strategy for Comparing File Copies , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[12]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[13]  Randy H. Katz,et al.  Raid-ii: a scalable storage architecture for high-bandwidth network file service , 1992 .

[14]  Randy H. Katz,et al.  Failure correction techniques for large disk arrays , 1989, ASPLOS III.

[15]  Mark Holland,et al.  On-Line Data Reconstruction in Redundant Disk Arrays (CMU-CS-94-164) , 1994 .

[16]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[17]  John C. S. Lui,et al.  Performance Analysis of Disk Arrays under Failure , 1990, VLDB.

[18]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[19]  Kun-Lung Wu,et al.  Low-Cost Comparison and Diagnosis of Large Remotely Located Files , 1986, Symposium on Reliability in Distributed Software and Database Systems.

[20]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[21]  F. Preparata Holographic dispersal and recovery of information , 1989, IEEE Trans. Inf. Theory.

[22]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[23]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[24]  J. Menon,et al.  Distributed sparing in disk arrays , 1992, Digest of Papers COMPCON Spring 1992.