Conditional response times in the M/G/1 processor-sharing system
- 1 December 1983
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 20 (4) , 910-915
- https://doi.org/10.2307/3213604
Abstract
The expected response time of a job that requires processing time t and meets n jobs on arrival in the M/G/1 processor-sharing system is derived.Keywords
This publication has 8 references indexed in Scilit:
- A Generalization of Erlang's Loss System to State Dependent Arrival and Service RatesMathematics of Operations Research, 1978
- Technical Note—Conditional Response Times in M/M/1 Processor-Sharing ModelsOperations Research, 1976
- Direct Solutions of M/G/1 Processor-Sharing ModelsOperations Research, 1974
- An Analysis of the M/G/1 Queue Under Round-Robin SchedulingOperations Research, 1971
- Waiting Time Distributions for Processor-Sharing SystemsJournal of the ACM, 1970
- Time-shared SystemsJournal of the ACM, 1967
- A Proof for the Queuing Formula: L = λWOperations Research, 1961
- On Queues with Poisson ArrivalsThe Annals of Mathematical Statistics, 1957