Queueing Systems

, Volume 19, Issue 3, pp 331–344

Waiting time distributions for closed M/M/N processor sharing queues

  • Jens Braband
Article

Abstract

We consider a multiple server processor sharing model with a finite number of terminals (customers). Each terminal can submit at most one job for service at any time. The think times of the terminals and the service time demands are independently exponentially distributed. We focus our attention on the exact detailed analysis of the waiting time distribution of a tagged job. We give the Laplace-Stieltjes transform of the waiting time distribution conditioned on the job's service time demand and the state of the other terminals and show that these transforms can be efficiently evaluated and inverted. Further results include the representation of conditioned waiting times as mixtures of a constant and several exponentially distributed components. The numerical precision of our results is being compared with results from a discrete approximation of the waiting time distributions.

Keywords

Processor sharing multiple server queues central server model waiting time distributions Laplace transforms numerical inversion 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Abate and W. Whitt, The Fourier series method for inverting transforms of probability distributions, Queueing Systems 10 (1992) 5–88.Google Scholar
  2. [2]
    J. Braband, Wartezeitverteilungen für M/M/N-Processor-Sharing-Modelle, Dissertation, Technische UniversitÄt Braunschweig, Braunschweig (1992), in German, available on request from the author.Google Scholar
  3. [3]
    J. Braband and R. Scha\berger, Random quantum allocation: A natural approach to M/M/N processor sharing queues, in:Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, eds. B. Walke and O. Spaniol, (Springer, Berlin, 1993. 7. ITG/GI Fachtagung) pp. 130–142.Google Scholar
  4. [4]
    E.G. Coffman, R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. ACM 17 (1970) 123–130.Google Scholar
  5. [5]
    D.K. Faddejew and W.N. Faddejewa,Numerische Methoden der Linearen Algebra (Oldenbourg, München, 1976).Google Scholar
  6. [6]
    D.P. Gaver and P.A. Jacobs, Processor-shared time-sharing models in heavy-traffic, SIAM J. Comp. 15 (1986) 1085–1100.Google Scholar
  7. [7]
    A.C. Hearn,REDUCE User's Manual Version 3.2 (Rand Pub. CP 78, 1985).Google Scholar
  8. [8]
    F.P. Kelly,Reversibility and Stochastic Networks (Wiley, Chichester, 1979).Google Scholar
  9. [9]
    L. Kleinrock,Queueing Systems, Vol. 2 (Wiley, New York, 1976).Google Scholar
  10. [10]
    C. Knessl, On finite capacity processor shared queues, SIAM J. Appl. Math. 50 (1990) 264–287.Google Scholar
  11. [11]
    D. Mitra, Waiting time distributions from closed queueing network models of shared-processor systems, in:Performance '81, ed. F.J. Kylstra, (North-Holland, Amsterdam, 1981) pp. 113–131.Google Scholar
  12. [12]
    D. Mitra and J.A. Morrisson, Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job-classes, Adv. Appl. Prob. 13 (1983) 813–839.Google Scholar
  13. [13]
    J.A. Morrison, Conditioned response-time distribution for a large closed processor-sharing system in very heavy usage, SIAM J. Appl. Math. 47 (1987) 1117–1129.Google Scholar
  14. [14]
    J.A. Morrisson, Asymptotic analysis of the waiting time distribution for a large closed processor-sharing system, SIAM J. Appl. Math. 46 (1986) 140–170.Google Scholar
  15. [15]
    J.A. Morrisson, Moments of the conditioned waiting time in a large closed processor-sharing system, Stoch. Models 2 (1986) 293–321.Google Scholar
  16. [16]
    W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Vetterling,Numerical Recipes (Cambridge University Press, Cambridge, 1986).Google Scholar
  17. [17]
    K.C. Sevcik and I. Mitrani, The distribution of queueing network states at input and output instants, J. ACM 28 (1981) 358–371.Google Scholar
  18. [18]
    S.F. Yashkov, Processor-sharing queues: Some progress in analysis,Queueing Systems 2 (1987) 1–17.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • Jens Braband
    • 1
  1. 1.Siemens AGBereich VerkehrstechnikBraunschweigGermany

Personalised recommendations