Parallel Service with Vacations

We study a system with unlimited service potential where all service requests are served in parallel. The entire system itself becomes unavailable for a random period of time at the first instance that the system becomes idle. A queue builds up while the system is unavailable, and then all waiting customers enter the system simultaneously-each to its own processor-when the system becomes available again. All customers who arrive to find the system in operation proceed directly into service. The analysis of this system entails finding the distribution of the delayed busy period of an M/G/∞ queue. The steady-state distribution of the number of customers in the system is obtained for the special cases of exponential and deterministic service times. Among other applications, our results enable us to analyze and solve for the optimal N-policy for the systems with unlimited service potential. We also study a multiclass model of a polling system with exhaustive service.

[1]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[2]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[3]  Offer Kella.  The threshold policy in the M/G/1 queue with server vacations , 1989 .

[4]  Gideon Weiss,et al.  Dynamic priority rules when polling with multiple parallel servers , 1992, Oper. Res. Lett..

[5]  William G. Marchal,et al.  State Dependence in M/G/1 Server-Vacation Models , 1988, Oper. Res..

[6]  Edward G. Coffman,et al.  The gated infinite-server queue: uniform service times , 1992 .

[7]  D. N. Shanbhag,et al.  On infinite server queues with batch arrivals , 1966 .

[8]  J. Michael Steele,et al.  Transient behavior of coverage processes by applications to the infinite-server queue , 1993 .

[9]  W. Stadje.  The busy period of the queueing system M / G /∞ , 1985 .

[10]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[11]  J. George Shanthikumar.  On Stochastic Decomposition in M/G/1 Type Queues with Generalized Server Vacations , 1988, Oper. Res..

[12]  N. U. Prabhu,et al.  Stochastic Storage Processes , 1980 .

[13]  Colin E. Bell,et al.  Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server , 1971, Oper. Res..

[14]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[15]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[16]  Douglas P. Wiens,et al.  On the busy period distribution of the M/G/2 queueing system , 1989, Journal of Applied Probability.

[17]  Daniel P. Heyman,et al.  Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[18]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[19]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[20]  J. Hammersley,et al.  On a probability problem arising in the theory of counters , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.

[21]  M. Yadin,et al.  Queueing Systems with a Removable Service Station , 1963 .

[22]  Kazimierz Sobczyk,et al.  Stochastic modelling and analysis of fatigue , 1988 .

[23]  Ahsan Kareem,et al.  On Stochastic Decomposition and Its Applications in Probabilistic Dynamics , 1990 .

[24]  Paul E. Wright,et al.  GATED, EXHAUSTIVE, PARALLEL SERVICE , 1992 .

[25]  Matthew J. Sobel,et al.  Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..

[26]  Ward Whitt,et al.  Queues with Server Vacations and Levy Processes with Secondary Jump Input , 1991 .