Stability criterion of a multiserver model with simultaneous service

In this paper, we study a multiserver system in which each customer requires a random number of servers simultaneously and a random but identical service time at all occupied servers. This model describes the dynamics of modern high performance clusters. Stability criteria of this system (under exponential assumptions) have been proved earlier for the two-server system only. Using a matrix-analytic approach, we obtain stability criteria of such a system under exponential assumptions and with an arbitrary number of servers.

[1]  Percy H. Brill.  Level Crossing Methods in Stochastic Models , 2017 .

[2]  Ph. Robert,et al.  A dynamic storage process , 1990 .

[3]  Oleg M. Tikhonenko,et al.  Generalized Erlang Problem for Service Systems with Finite Total Capacity , 2005, Probl. Inf. Transm..

[4]  P. H. Brill,et al.  The System Point Method in Exponential Queues: A Level Crossing Approach , 1981, Math. Oper. Res..

[5]  Awi Federgruen,et al.  An M/G/c queue in which the number of servers required is random , 1984 .

[6]  Nico M. van Dijk,et al.  Blocking of finite source inputs which require simultaneous servers with general think and holding times , 1989 .

[7]  Paul Erdös,et al.  On an Elementary Proof of Some Asymptotic Formulas in the Theory of Partitions , 1942 .

[8]  Qi-Ming He,et al.  Fundamentals of Matrix-Analytic Methods , 2013, Springer New York.

[9]  Harry G. Perros,et al.  A queueing system where customers require a random number of servers simultaneously , 1986 .

[10]  G. Andrews.  The Theory of Partitions: Frontmatter , 1976 .

[11]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[12]  Guy Latouche,et al.  Semi-explicit solutions for M/PH/1-like queuing systems , 1983 .

[13]  Helen D. Karatza,et al.  An M/M/2 parallel system model with pure space sharing among rigid jobs , 2007, Math. Comput. Model..

[14]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[15]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[16]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[17]  Richard C. Larson,et al.  An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers , 1989 .

[18]  Helen D. Karatza,et al.  Two-server parallel system with pure space sharing and Markovian arrivals , 2013, Comput. Oper. Res..

[19]  Andrew F. Seila.  Technical Note - On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers , 1984, Oper. Res..

[20]  Oliver C. Ibe,et al.  Markov processes for stochastic modeling , 2008 .

[21]  J. S. Kaufman,et al.  Sizing a Message Store Subject to Blocking Criteria , 1979, Performance.

[22]  Percy H. Brill,et al.  Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach , 1984 .

[23]  Linda Green,et al.  A Queueing System in Which Customers Require a Random Number of Servers , 1980, Oper. Res..

[24]  Linda V. Green.  Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers , 1981 .

[25]  Kenneth P. Bogart,et al.  Introductory Combinatorics , 1977 .

[26]  Edward P. C. Kao,et al.  Stationary Waiting Time Distribution of a Queue in Which Customers Require a Random Number of Servers , 1991, Oper. Res..

[27]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.