Edward K. Lee and Randy H. Katz

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-91-660

, 1991

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/CSD-91-660.pdf

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 for the optimal unit of data striping in disk arrays.

---

BibTeX citation:

@techreport{Lee:CSD-91-660,
    Author= {Lee, Edward K. and Katz, Randy H.},
    Title= {An Analytic Performance Model of Disk Arrays and its Application},
    Year= {1991},
    Month= {Nov},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/6145.html},
    Number= {UCB/CSD-91-660},
    Abstract= {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 for the optimal unit of data striping in disk arrays.},
}

EndNote citation:

%0 Report
%A Lee, Edward K. 
%A Katz, Randy H. 
%T An Analytic Performance Model of Disk Arrays and its Application
%I EECS Department, University of California, Berkeley
%D 1991
%@ UCB/CSD-91-660
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/6145.html
%F Lee:CSD-91-660