A new approach to the M/G/1 processor-sharing queue
- 1 March 1984
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 16 (1) , 202-213
- https://doi.org/10.2307/1427231
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
This publication has 3 references indexed in Scilit:
- A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributionsActa Informatica, 1981
- On the response time distribution in a discrete round-robin queueActa Informatica, 1981
- Waiting Time Distributions for Processor-Sharing SystemsJournal of the ACM, 1970