Processor-sharing queues: Some progress in analysis
- 1 March 1987
- journal article
- research article
- Published by Springer Nature in Queueing Systems
- Vol. 2 (1) , 1-17
- https://doi.org/10.1007/bf01182931
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFOJournal of Applied Probability, 1986
- Sojourn times in a tandem queue with overtaking: reduction to a boundary value problemCommunications in Statistics. Stochastic Models, 1986
- Queueing Networks: A Survey of Their Random ProcessesSIAM Review, 1985
- On processor sharing and random serviceJournal of Applied Probability, 1984
- M/G/∞ tandem queuesStochastic Processes and their Applications, 1984
- Conditional response times in the M/G/1 processor-sharing systemJournal of Applied Probability, 1983
- Brownian Excursion, the M/M/1 Queue and Their Occupation TimesMathematics of Operations Research, 1981
- Approximations of the Mean Waiting Time in an M/G/s Queueing SystemOperations Research, 1979
- The multiple phase service network with generalized processor sharingActa Informatica, 1979
- Waiting Time Distributions for Processor-Sharing SystemsJournal of the ACM, 1970