RESPONSE TIMES IN M/M/1 TIME-SHARING SCHEMES WITH LIMITED NUMBER OF SERVICE POSITIONS
暂无分享,去创建一个
Two service schemes for an MMI/ time-sharing system with a limited number of service positions are studied. Both schemes possess the equilibrium properties of symmetric queues; however, in the first one, a preempted job is placed at the end of the waiting line; while in the second one, it is placed at the head of the line. Methods for calculating the Laplace transforms and moments of the response times are presented. The variances of the response times are then compared numerically to indicate that the first scheme is superior to the second scheme. It is also indicated that in both cases the response time variance decreases when the number of service positions increases.
[1] Benjamin Avi-Itzhak,et al. Server sharing with a limited number of service positions and symmetric queues , 1987 .
[2] Edward G. Coffman,et al. Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.
[3] T. Ott. THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .
[4] Frank Kelly,et al. Reversibility and Stochastic Networks , 1979 .