An Analytic Performance Model of Disk Arrays And Its Application

As disk arrays become widely used, tools for understanding and analyzing their performance become increasingly important. In particular, performance models can be invaluable in both configuring and designing disk arrays. Accurate analytic performance models are desirable over other types of models because they can be quickly evaluated, are applicable under a wide range of system and workload parameters, and can be manipulated by a range of mathematical techniques. Unfortunately, analytic performance models of disk arrays are difficult to formulate due to the presence of queuing and fork-join synchronization: a disk array request is broken up into independent disk requests which must all complete to satisfy the original request. In this paper, we develop, validate and apply an analytic performance model for disk arrays. We derive simple equations for approximating their utilization, response time and throughput. We then validate the analytic model via simulation and investigate the accuracy of each approximation used in deriving the analytic model. Finally, we apply the analytic model to derive an equation of the optimal unit of data striping in disk arrays.

[1]  A. L. Narasimha Reddy,et al.  An Evaluation of Multiple-Disk I/O Systems , 1989, IEEE Trans. Computers.

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

[3]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .

[4]  Asser N. Tantawi,et al.  Asynchronous Disk Interleaving: Approximating Access Delays , 1991, IEEE Trans. Computers.

[5]  Dina Bitton,et al.  Disk Shadowing , 1988, VLDB.

[6]  Prithviraj Banerjee,et al.  Performance Evaluation of Multiple-Disk I/O Systems , 1989, International Conference on Parallel Processing.

[7]  David A. Patterson,et al.  Maximizing performance in a striped disk array , 1990, ISCA '90.

[8]  Michelle Y. Kim,et al.  Synchronized Disk Interleaving , 1986, IEEE Transactions on Computers.

[9]  Randy H. Katz,et al.  Input/output behavior of supercomputing applications , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[10]  Randy H. Katz,et al.  Introduction to redundant arrays of inexpensive disks (RAID) , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[11]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[12]  Miron Livny,et al.  Multi-disk management algorithms , 1987, SIGMETRICS '87.

[13]  L. Flatto,et al.  Erratum: Two Parallel Queues Created by Arrivals with Two Demands I , 1985 .

[14]  Randy H. Katz,et al.  An evaluation of redundant arrays of disks using an Amdahl 5890 , 1990, SIGMETRICS '90.

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

[16]  Kishor S. Trivedi,et al.  Queueing Network Models for Parallel Processing with Asynchronous Tasks , 1982, IEEE Transactions on Computers.