We develop a queueing model that approximates the effect of synchronisations at parallel service completion instants. We first obtain exact results for the maxima of independent exponential random variables with arbitrary parameters and follow this with an approximation for general random variables, which reduces to the exact result in the exponential case. We use this in a queueing model of RAID (Redundant Array of Independent Disks) systems, in which accesses to multiple disks occur concurrently and complete only when every disk involved has completed. The random variables to be maximised are therefore disk response times which are modelled by the waiting times in an M/G/1 queue. To compute the mean value of their maximum requires the second moment of queueing time and we obtain this in terms of the third moment of disk service time, itself a function of seek time, rotational latency and block transfer time. These quantities are analysed individually in detail. Validation by simulation, with realistic hardware parameters and block sizes, shows generally good agreement at all traffic intensity levels, including the threshold above which performance deteriorates sharply.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    The RAID Advisory board. The RAIDBOOK: A source Book for RAID Technology. Lino Lakes MN Publisher (June 1993)Google Scholar
  2. 2.
    Bohnenkamp, H., Haverkort, B.: The mean value of the maximum. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 37–56. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Chen, S.: Design, Modeling and evaluation of high performance, Ph.D. thesis. Ph.D. thesis, University of Massachusetts, USA (September 1992)Google Scholar
  4. 4.
    Chen, S., Towsley, D.: A performance evaluation of RAID architecture. IEEE Transactions on computers (January 1997)Google Scholar
  5. 5.
    Gibson, G., Patterson, D.A., Katz, R.H.: A case for redundant arrays of inexpensive disks (RAID). In: Proceedings of SIGMOD Conference (June 1988)Google Scholar
  6. 6.
    Gibson, G., Patterson, D.A., Chen, P.M., Katz, R.H.: Introduction to redundant arrays of inexpensive disks (RAID). In: IEEE COMPCON (1989)Google Scholar
  7. 7.
    Gravey, A.: A simple construction of an upper bound for the mean of the maximum of n identically distributed random variables. Journal on Applied Probability (22), 844–865 (1985)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hock, N.C. (ed.): Queueing Modelling Fundamentals. John Wiley Publisher, Chichester (1996)MATHGoogle Scholar
  9. 9.
    Lee, E.K., Katz, R.H.: An analytic perfomance model of disk arrays and its application. In Technical Report UCB/CSD 92/660 (November 1991)Google Scholar
  10. 10.
    Mitrani, I., Hamilton, M., McKee, P.: Distributed systems with different degrees of multicasting. In: Proceedings of WOSP 2002, 3rd International Workshop on Software and Performance (July 2002)Google Scholar
  11. 11.
    Zertal, S.: Dynamic redundancy mechanisms for storage customisation on multi disks storage systems. Ph.D. thesis, University of Versailles, France (January 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Peter Harrison
    • 1
  • Soraya Zertal
    • 2
  1. 1.Imperial College LondonLondonUK
  2. 2.PRiSMUniversité de VersaillesVersaillesFrance

Personalised recommendations