scholarly journals Correction to: Multi-server queueing systems with multiple priority classes

2021 ◽  
Author(s):  
Mor Harchol-Balter ◽  
Takayuki Osogami ◽  
Alan Scheller-Wolf ◽  
Adam Wierman
Author(s):  
Weina Wang ◽  
Qiaomin Xie ◽  
Mor Harchol-Balter

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.


2017 ◽  
Author(s):  
Hung Do ◽  
Masha Shunko ◽  
Marilyn T. Lucas ◽  
David A. Novak

1979 ◽  
Vol 11 (02) ◽  
pp. 448-455 ◽  
Author(s):  
David Sonderman

We compare two queueing systems with identical general arrival streams, but different numbers of servers, different waiting room capacities, and stochastically ordered service time distributions. Under appropriate conditions, it is possible to construct two new systems on the same probability space so that the new systems are probabilistically equivalent to the original systems and each sample path of the stochastic process representing system size in one system lies entirely below the corresponding sample path in the other system. This construction implies stochastic order for these processes and many associated quantities of interest, such as a busy period, the number of customers lost in any interval, and the virtual waiting time.


1979 ◽  
Vol 11 (2) ◽  
pp. 439-447 ◽  
Author(s):  
David Sonderman

We compare two queueing systems with the same number of servers that differ by having stochastically ordered service times and/or interarrival times as well as different waiting room capacities. We establish comparisons for the sequences of actual-arrival and departure epochs, and demonstrate by counterexample that many stochastic comparisons possible with infinite waiting rooms no longer hold with finite waiting rooms.


2019 ◽  
Vol 21 (4) ◽  
pp. 405-415
Author(s):  
Hassan Halabian ◽  
Ioannis Lambadaris ◽  
Yannis Viniotis

Sign in / Sign up

Export Citation Format

Share Document