Optimal scheduling in the multiserver-job model under heavy traffic
Multiserver-job systems, where jobs require concurrent service at many servers, occur
widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses …
widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses …
Scalable load balancing in networked systems: A survey of recent advances
In this survey we provide an overview of recent advances on scalable load balancing
schemes which provide favorable delay performance and yet require minimal …
schemes which provide favorable delay performance and yet require minimal …
The RESET and MARC techniques, with application to multiserver-job analysis
Abstract Multiserver-job (MSJ) systems, where jobs need to run concurrently across many
servers, are increasingly common in practice. The default service ordering in many settings …
servers, are increasingly common in practice. The default service ordering in many settings …
The multiserver job queueing model
M Harchol-Balter - Queueing Systems, 2022 - Springer
A great deal of queueing theory is devoted to studying multiserver models, such as the
M/G/n. A key feature of such models is that each job runs on a single server. Unfortunately …
M/G/n. A key feature of such models is that each job runs on a single server. Unfortunately …
Three-level modeling of a speed-scaling supercomputer
A Rumyantsev, R Basmadjian, S Astafiev… - Annals of Operations …, 2023 - Springer
In this paper we study a simultaneous service multiserver system which we call speed-
scaling supercomputer, where speed-scaling is used to address the performance/power …
scaling supercomputer, where speed-scaling is used to address the performance/power …
Sharp waiting-time bounds for multiserver jobs
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service,
are prevalent in today's computing clusters. But little is known about the delay performance …
are prevalent in today's computing clusters. But little is known about the delay performance …
Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times
We consider the classic problem of preemptively scheduling jobs of unknown size (aka
service time) in a queue to minimize mean number-in-system, or equivalently mean …
service time) in a queue to minimize mean number-in-system, or equivalently mean …
Steady‐state analysis of load balancing with Coxian‐2 distributed service times
This paper studies load balancing for many‐server (N servers) systems. Each server has a
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …
buffer of size b− 1, and can have at most one job in service and b− 1 jobs in the buffer. The …
The saturated Multiserver Job Queuing Model with two classes of jobs: Exact and approximate results
We consider a multiserver queue where jobs request for a varying number of servers for a
random service time. The requested number of servers is assigned to each job following a …
random service time. The requested number of servers is assigned to each job following a …
[HTML][HTML] Queuing models of links carrying streaming and elastic services
We consider an access link carrying data generated by streaming and elastic services
requested by fixed or mobile end users, and subjected to an admission control (AC) …
requested by fixed or mobile end users, and subjected to an admission control (AC) …