Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
Published Online:1 Apr 1976https://doi.org/10.1287/opre.24.2.382
Abstract
We study the round-robin system in the limiting case when the quantum of service shrinks to zero. For an exponential processing-time distribution, we find an expression for the mean response time of a job conditioned on the service it requires and the number of jobs in the system on its arrival. Comparison is made with other queue disciplines.
