This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation
March 1996 (vol. 45 no. 3)
pp. 367-373

Abstract—A Redundant Array of Independent Disks (RAID) of G disks provides protection against single disk failures by adding one parity block for each G− 1 data blocks. In a clustered RAID, the G data/parity blocks are distributed over a cluster of C disks (C > G), thus reducing the additional load on each disk due to a single disk failure. However, most methods proposed for implementing such a mapping do not work for general C and G values.

In this paper, we describe a fast mapping algorithm based on almost-random permutations. An analytical model is constructed, based on the queue with a permanent customer, to predict recovery time and read/write performance. The accuracy of the results derived from this model is validated by comparing with simulations. Our analysis shows that clustered RAID is significantly more tolerant of disk failure than the basic RAID scheme. Both recovery time and performance degradation during recovery are substantially reduced in clustered RAID; moreover, these gains can be achieved using fairly small C/G ratios.

[1] P.M. Chen, E.K. Lee, G.A. Gibson, R.H. Katz, and D.A. Patterson, "RAID: High-Performance Reliable Secondary Storage," ACM Computing Surveys, vol. 36, no. 3, pp. 145-185, Aug. 1994.
[2] E.J. Gumbel,Statistics of Extremes. Columbia Univ. Press, 1958.
[3] M. Hall,Combinatorial Theory. Wiley-Interscience, 1986.
[4] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[5] M. Holland and G.A. Gibson, "Parity Declustering for Continuous Operation in Redundant Disk Arrays," Proc. Fifth Architectural Support for Programming Languages and Operating Systems, pp. 23-35,Boston, Oct. 1992.
[6] L. Kleinrock,Queueing Systems, vol. I: Theory. John Wiley&Sons, 1975.
[7] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[8] A. Merchant and P.S. Yu, "Design and Modeling of Clustered RAID," Proc. 22th Int'l Symp. Fault Tolerant Computing Systems, pp. 140-149,Boston, July 1992.
[9] A. Merchant and P. Yu, "Analytic Modeling and Comparisons of Striping Strategies for Replicated Disk Arrays," IEEE Trans. Computers, vol. 44, pp. 419-433, 1995.
[10] R.R. Muntz and J.C.S. Lui, "Performance Analysis of Disk Arrays Under Failure," Proc. 16th Int'l Conf. Very Large Data Bases, pp. 162-173,Brisbane, Australia, Aug. 1990.
[11] S.W. Ng and R.L. Mattson, "Uniform Parity Distribution in Disk Arrays with Multiple Failures," IEEE Trans. Computers, vol. 43, no. 4, pp. 501-506, Apr. 1994.
[12] A.L. Narasimha Reddy and P. Banerjee, "Gracefully Degradable Disk Arrays," Proc. 21st Int'l Symp. Fault Tolerant Computing Systems, pp. 401-408,Montreal, Canada, June 1991.
[13] E. Thorp,"Nonrandom Shuffling with Applications to the Game of Faro," JASA, vol 68, pp. 842-847, 1973.

Index Terms:
Disk arrays, stochastic modeling, recovery time, performance degradation.
Citation:
Arif Merchant, Philip S. Yu, "Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation," IEEE Transactions on Computers, vol. 45, no. 3, pp. 367-373, March 1996, doi:10.1109/12.485575
Usage of this product signifies your acceptance of the Terms of Use.