This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Performance of Parity Placements in Disk Arrays
June 1993 (vol. 42 no. 6)
pp. 651-664

Due to recent advances in central processing unit (CPU) and memory system performance, input/output (I/O) systems are increasingly limiting the performance of modern computer systems. Redundant arrays of inexpensive disks (RAID) have been proposed to meet the impending I/O crisis. RAIDs substitute many small inexpensive disks for a few large expensive disks to provide higher performance, smaller footprints, and lower power consumption at a lower cost than the large expensive disks they replace. RAIDs provide high availability by using parity encoding of data to survive disk failures. It is shown that the way parity is distributed in a RAID has significant consequences for performance. The performances of eight different parity placements are investigated using simulation.

[1] D. A. Patterson, G. Gibson, and R. H. Katz, "A case for redundant arrays of inexpensive disks (RAID)," inProc. ACM SIGMOD, Chicago, IL, June 1-3, 1988, pp. 109-116.
[2] R. H. Katz, G. A. Gibson, and D. A. Patterson, "Disk system architectures for high performance computing,"Proc. IEEE, vol. 77, pp. 1842-1858, Dec. 1989.
[3] D. A. Patterson, P. M. Chen, G. Gibson, and R. H. Katz, "Introduction to redundant arrays of inexpensive disks (RAID)," inProc. IEEE COMPCON, pp. 112-117, Spring 1989.
[4] P. M. Chen, G. A. Gibson, R. H. Katz, and D. A. Patterson, "An evaluation of redundant arrays of disks using an Amdahl 5890," inProc. SIGMETRICS, pp. 74-85, May 1990.
[5] P. C. Dibble, "A parallel interleaved file system," Univ. Rochester, Rochester, NY, Tech. Rep. CS TR 334, Mar. 1990.
[6] J. Gray, B. Horst, and M. Walker, "Parity striping of disc arrays: Low-cost reliable storage with acceptable throughput," inProc. Very Large Data Bases, pp. 148-161, Aug. 1990.
[7] J. Menon and J. Kasson, "Methods for improved update performance of disk arrays," IBM Research Division, Almaden Research Center, San Jose, CA, Res. Rep. RJ 6928 (66034), 1989.
[8] E. L. Miller, "Input/output behavior of supercomputing applications," Univ. California, Berkeley, CA, Tech. Rep. UCB/CSD 91/616, 1991.
[9] E. K. Lee and R. H. Katz, "Performance consequences of parity placement in disk arrays," inProc. ASPLOS, pp. 190-199, Apr. 1991.
[10] M. Schulze, G. Gibson, R. H. Katz, and D. A. Patterson, "How reliable is a RAID?," inProc. IEEE COMPCON, pp. 118-123, Spring 1989.
[11] M. Y. Kim, "Synchronized disk interleaving," inProc. IEEE Trans. Comput., vol. C-35, no. 11, pp. 978-988, Nov. 1986.
[12] M. Y. Kim and A. N. Tantawi, "Asynchronous disk interleaving," IBM, Tech. Rep. RC12497, Jan. 1987.
[13] M. Livny, S. Khoshafian, and H. Boral, "Multi-disk management algorithms," inProc. SIGMETRICS, pp. 69-77, May 1987.
[14] K. Salem and H. Garcia-Molina, "Disk striping," inProc. IEEE Data Eng., pp. 336-342, Feb. 1986.

Index Terms:
redundant arrays of inexpensive disks; parity placements; disk arrays; RAID; power consumption; parity encoding; disk failures; performance; fault tolerant computing; magnetic disc storage; redundancy.
Citation:
E.K. Lee, R.H. Katz, "The Performance of Parity Placements in Disk Arrays," IEEE Transactions on Computers, vol. 42, no. 6, pp. 651-664, June 1993, doi:10.1109/12.277289
Usage of this product signifies your acceptance of the Terms of Use.