论文信息 - Technical Note - Conditional Response Times in M/M/1 Processor-Sharing Models

Technical Note - Conditional Response Times in M/M/1 Processor-Sharing Models

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.

T. M. O'Donovan

[1] T. M. O'Donovan. Direct Solutions of M/G/1 Processor-Sharing Models , 1974, Oper. Res..

[2] Shoichi Noguchi,et al. An Analysis of the M/G/1 Queue Under Round-Robin Scheduling , 1971, Oper. Res..

[3] Leonard Kleinrock,et al. Time-shared Systems: a theoretical treatment , 1967, JACM.

[4] Edward G. Coffman,et al. Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.