Abstract
We consider the M/G/1 queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer’s service requirement, as well as the unconditional distribution, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. Our results demonstrate the possible tail behaviors of the unconditional distribution, which was previously known in the cases G = M and G = D (where it is purely exponential). We assume that the service density decays at least exponentially fast. We use various methods for the asymptotic expansion of integrals, such as the Laplace and saddle point methods.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bleistein N, Handelsman RA (1986) Asymptotic expansions of integrals. Dover, New York
Borst SC, Boxma OJ, Morrison JA, Núñez Queija R (2003) The equivalence between processor sharing and service in random order. Oper Res Lett 31: 254–262
Borst S, Núñez-Queija R, Zwart B (2006) Sojourn time asymptotics in processor-sharing queues. Queueing Syst 53: 31–51
Coffman EG Jr, Muntz RR, Trotter H (1970) Waiting time distributions for processor-sharing systems. J ACM 17: 123–130
Cohen JW (1984) On processor sharing and random service (letter to the editor). J Appl Probab 21: 937
Egorova R, Zwart B (2007) Tail behavior of conditional sojourn times in processor-sharing queues. Queueing Syst 55: 107–121
Egorova R, Zwart AP, Boxma OJ (2006) Sojourn time tails in the M/D/1 processor sharing queue. Probab Eng Inf Sci 20: 429–446
Flatto L (1997) The waiting time distribution for the random order service M/M/1 queue. Ann Appl Probab 7: 382–409
Guillemin F, Boyer J (2001) Analysis of M/M/1 queue with processor sharing via spectral theory. Queueing Syst 39: 377–397
Kleinrock L (1964) Analysis of a time-shared processor. Nav Res Logist Q 11: 59–73
Kleinrock L (1967) Time-shared systems: a theoretical treatment. J ACM 14: 242–261
Knessl C (1992) Asymptotic approximations for the GI/M/1 queue with processor-sharing service. Stoch Models 8: 1–34
Mandjes MRH, Zwart AP (2006) Large deviations of sojourn times in processor sharing queues. Queueing Syst 52: 237–250
Morrison JA (1985) Response-time distribution for a processor-sharing system. SIAM J Appl Math 45: 152–167
Ott TJ (1984) The sojourn time distribution in the M/G/1 queue with processor sharing. J Appl Probab 21: 360–378
Pollaczek F (1946) La loi d’attente des appels téléphoniques. C R Acad Sci Paris 222: 353–355
Ramaswami V (1984) The sojourn time in the GI/M/1 queue with processor sharing. J Appl Probab 21: 445–450
Riordan J (1962) Stochastic service systems. Wiley, New York
Sengupta B (1992) An approximation for the sojourn-time distribution for the GI/G/1 processor-sharing queue. Stoch Models 8: 35–57
Sengupta B, Jagerman DL (1985) A conditional response time of the M/M/1 processor-sharing queue. AT&T Tech J 64: 409–421
Wong R (2001) Asymptotic approximation of integrals. SIAM, Philadelphia
Yashkov SF (1987) Processor-sharing queues: some progress in analysis. Queueing Syst 2: 1–17
Yashkov SF (1992) Mathematical problems in the theory of processor-sharing queueing systems. J Sov Math 58: 101–147
Yashkov SF (2006) On asymptotic property of the sojourn time in the M/G/1-EPS queue. Inf Process (Russian) 6: 256–257
Yashkov SF, Yashkova AS (1997) The M/G/1 processor-sharing system: the transient solutions. In: Proceedings of the 2nd international conference on distributed computer communication networks (DCCN’97), Tel-Aviv. Inst. Problem Peredachi Inf., Moscow, pp 261–272
Yashkov SF, Yashkova AS (2004) The time-dependent solution of the M/G/1-FBPS queue. Inf Process 4: 175–187
Yashkov SF, Yashkova AS (2007) Processor sharing: a survey of the mathematical theory. Autom Remote Control 68: 1662–1731
Zhen Q, Knessl C (2007) Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue. Queueing Syst 57: 157–168
Zwart AP, Boxma OJ (2000) Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst 35: 141–166
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhen, Q., Knessl, C. Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue. Math Meth Oper Res 71, 201–244 (2010). https://doi.org/10.1007/s00186-009-0290-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-009-0290-9