Stationary increments in the accumulated work process in processor-sharing queues
This paper studies the accumulated work process in a processor-sharing queue. A new approach is presented that allows the authors to study the accumulated work process of a job that requires an amount of processing time x. This method simplifies the proofs of some earlier results on expected conditional response times and extends them to the M/G/\(\Phi\) (\(\cdot)\) class. A new result is given on the stationarity of increments in the process of accumulated work which yields the linearity of the conditional expected response time as a corollary. The analysis presents some results that make the previous results quite surprising. The principal technique is to randomly scale time and work with processes on this new time axis. This technique provides insight into the somewhat paradoxical properties of this system.
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- Mathematical problems in the theory of processor-sharing queueing systems
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- Stationary increments of accumulation processes in queues and generalized semi-Markov schemes
- scientific article; zbMATH DE number 975785 (Why is no real title available?)
- Processor sharing: a survey of the mathematical theory
This page was built for publication: Stationary increments in the accumulated work process in processor-sharing queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733213)