Stationary increments in the accumulated work process in processor-sharing queues

From MaRDI portal





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.











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)