A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics

A closed processor-sharing queueing model that corresponds to M terminals in series with a central processing unit (CPU) is considered under heavy usage conditions. The effects of switching times between the CPU and the individual jobs are included by assuming that the effective service rate that the CPU provides is a decreasing function of the instantaneous number of jobs being processed. Using perturbation methods, asymptotic expansions are constructed for the first two moments of a customer's response (sojourn) time, conditioned on that customer's total required service from the CPU. The asymptotic limit assumes that the number of terminals M is large $( M \gg 1 )$, that the rate at which the CPU provides service is fast $( O( M ) )$, and that the duration of a typical switching time is small compared to the time the CPU actually spends servicing the individual jobs. Extensive numerical comparisons show the quality of our asymptotic approximations.

[1]  Leonard Kleinrock,et al.  Analysis of A time‐shared processor , 1964 .

[2]  Martin Greenberger,et al.  The Priority Problem and Computer Time Sharing , 1966 .

[3]  Benjamin Avi-Itzhak,et al.  A Time-Sharing Queue with a Finite Number of Customers , 1969, JACM.

[4]  Leonard Kleinrock Swap-Time Considerations in Time-Shared Systems , 1970, IEEE Transactions on Computers.

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

[6]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[7]  John A. Morrison,et al.  Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System , 1983, SIAM J. Comput..

[8]  J. Morrison Response-Time Distribution for a Processor-Sharing System , 1985 .

[9]  J. Morrison Asymptotic analysis of the waiting-time distribution for a large closed processor-sharing system , 1986 .

[10]  J. Morrison Moments of the conditioned waiting time in a large closed processor-sharing system , 1986 .

[11]  J. Morrison Conditioned response-time distribution for a large closed processor-sharing system in very heavy usage , 1987 .

[12]  J. Morrison Conditioned response-time distribution for a large closed processor-sharing system with multiple classes in very heavy usage , 1988 .

[13]  C. Knessl,et al.  Response times in processor-shared queuses with state-dependent arrival rates , 1989 .

[14]  C. Knessl On finite capacity processor-shared queues , 1990 .

[15]  A. Bersani,et al.  Asymptotic analysis for a closed processor-sharing system with switching times: normal usage , 1991 .

[16]  C. Knessl,et al.  A processor-shared queue that models switching times: normal usage , 1992 .