Article contents
Stationary increments in the accumulated work process in processor-sharing queues
Published online by Cambridge University Press: 14 July 2016
Abstract
We present a new approach to the processor-sharing queue that allows us to study the accumulated work process of a job that requires an amount of processing time x. Our approach simplifies the proofs of some earlier results on expected conditional response times and extends them to the M/G/φ (·) class. The approach illuminates some of the paradoxical features of these systems.
Keywords
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1989
References
- 6
- Cited by