Abstract
In this paper simple approximations are derived for the second moment of the conditional and unconditional sojourn time in the M/G/1 processor sharing queue. The approximations are mainly based on general asymptotic results (e.g. heavy traffic) and on simple exact expressions for specific service time distributions. They depend on the service time distribution only through its first and second moment. Numerous numerical examples show that these simple approximations are accurate enough for many practical purposes. A refinement of the approximations is obtained by taking the third moment of the service time into account.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Van den Berg, J.L., Boxma, O.J. (1989). Sojourn times in feedback and processor sharing queues. In: Teletraffic Science for new Cost-Effective Systems, Networks and Services, ITC 12, ed. M. Bonatti (North-Holland Publ. Cy., Amsterdam).
Van den Berg, J.L. (1988). Unpublished work.
Cohen, J.W. (1982). The Single Server Queue, 2nd ed. (North-Holland Publ. Cy., Amsterdam).
Jaiswal, N.K. (1982). Performance evaluation studies for time sharing computer systems, Perf. Eval. 2, 223–236.
Kleinrock, L. (1976). Queueing Systems, Vol. II (Wiley, New York).
Ott, T.J. (1984). The sojourn-time distribution in the M/G/1 queue with processor sharing, J. Appl. Prob. 21, 360–378.
Schassberger, R. (1984). A new approach to the M/G/l processor-sharing queue, Adv. Appl. Prob. 16, 202–213.
Tijms, H.C. (1986). Stochastic Modeling and Analysis (Wiley, New York).
Whitt, W. (1982). Approximating a point process by a renewal process, I: Two basic methods, Oper. Res. 30, 125–147.
Whitt, W. (1984). On approximations for queues, III: Mixtures of exponential distributions, AT&T Bell Lab. Tech. J. 63, 163–175.
Yashkov, S.F. (1983). A derivation of response time distribution for an M/G/1 processor-sharing queue, Problems Contr. & Info. Theory 12, 133–148.
Yashkov, S.F. (1986). A note on asymptotic estimates of the sojourn time variance in the M/G/1 queue with processor-sharing, Syst. Anal. Model. Simul. 3, 267–269.
Yashkov, S.F. (1987). Processor-sharing queues: some progress in analysis, Queueing Systems 2, 1–17.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van den Berg, J.L. (1989). Simple Approximations for Second Moment Characteristics of the Sojourn Time in the M/G/1 Processor Sharing Queue. In: Stiege, G., Lie, J.S. (eds) Messung, Modellierung und Bewertung von Rechensystemen und Netzen. Informatik-Fachberichte, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75079-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-75079-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51713-9
Online ISBN: 978-3-642-75079-3
eBook Packages: Springer Book Archive