Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-02T22:42:49.477Z Has data issue: false hasContentIssue false
  • English
  • Français

A new approach to the M/G/1 processor-sharing queue

Published online by Cambridge University Press:  01 July 2016

R. Schassberger
R. Schassberger*
Affiliation:
Technische Universität Berlin
*
∗Postal address: Technische Universität Berlin, Fachbereich 3—Mathematik, Sekt. MA 7–5, 1000 Berlin 12, Strasse des 17. Juni 135, Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.

Keywords

TIME SHARINGPRIORITIES
Type
Research Article
Information
Advances in Applied Probability , Volume 16 , Issue 1 , March 1984 , pp. 202 - 213
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.CrossRefGoogle Scholar
[2] Daduna, H. and Schassberger, R. (1981) A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions. Acta Informatica 15, 251–263.CrossRefGoogle Scholar
[3] Kitayev, M. Yu. and Yashkov, S. F. (1978) Distribution of the conditional sojourn time in a system with division of time of servicing. Engineering Cybernetics 16, 162–167.Google Scholar
[4] Kitayev, M. Yu. and Yashkov, S. F. (1979) Analysis of a single-channel queueing system with the discipline of uniform sharing of a device. Engineering Cybernetics 17, 42–49.Google Scholar
[5] Kleinrock, L. (1976) Queueing Systems. Vol. 2. Wiley, New York.Google Scholar
[6] Schassberger, R. (1981) On the response time distribution in a round-robin queue. Acta Informatica 16, 57–62.CrossRefGoogle Scholar
[7] Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
[8] Yashkov, S. F. (1981) Some results of analyzing a probabilistic model of remote processing systems. Automat. Control and Computer Sci. 15, 1–8.Google Scholar