Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-10T19:55:00.649Z Has data issue: false hasContentIssue false
  • English
  • Français

The sojourn time in the GI/M/1 queue by processor sharing

Published online by Cambridge University Press:  14 July 2016

V. Ramaswami
V. Ramaswami*
Affiliation:
Bell Communications Research, Inc.
*
∗ Postal address: Bell Communications Research, Inc., Rm 4K420, Crawfords Corner Rd, Holmdel, NJ 07733, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

A queueing model of considerable interest in computer engineering is the processor-sharing model in which the server shares its fixed capacity equally among all units present in the system. Here, we derive the mean and the variance of the equilibrium sojourn time, and deduce that the variance of the sojourn time is larger for the processor-sharing model than for the corresponding FCFS model.

Type
Short Communications
Information
Journal of Applied Probability , Volume 21 , Issue 2 , June 1984 , pp. 437 - 442
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Coffman, E. G., Muntz, R. R. and Trotter, H. (1970) Waiting time distributions for processor sharing systems. J. Assoc. Comput. Mach. 17, 123–130.Google Scholar
[2] Conolly, B. W. (1959) The busy period in relation to the queueing process G/M/1. Biometrika 46, 246–251.Google Scholar
[3] Kleinrock, L. (1976) Queueing Systems, Vol. 2. Wiley, New York.Google Scholar
[4] O'donovan, T. M. (1974) Direct solutions of M/G/1 processor sharing models. Operat. Res. 22, 1232–1235.Google Scholar
[5] Ott, T. J. (1984) The sojourn time distribution in the M/G/1 queue with processor sharing. J. Appl. Prob. 21, 368–386.Google Scholar
[6] Ramaswami, V. (1982) The busy period of queues which have a matrix-geometric steady state probability vector. Opsearch 19, 238–261.Google Scholar