In this survey we provide an overview of recent advances on scalable load balancing
schemes which provide favorable delay performance and yet require minimal …

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 …

A pivotal methodological tool behind the analysis of large-scale load balancing systems is
mean-field analysis. The high-level idea is to represent the system state by aggregate …

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 …

Motivated by applications that involve setting proper staffing levels for multi-server queueing
systems with batch arrivals, we present a thorough study of the queue-length process $\{Q …

This paper studies the sensitivity (or insensitivity) of a class of load balancing algorithms that
achieve asymptotic zero-waiting in the sub-Halfin-Whitt regime, named LB-zero. Most …

In this paper we introduce the work-conserving finite-skip class of models. This class
includes many important models, such as the heterogeneous M/G/k, the limited processor …

We consider systems where multiple servers operate in parallel, with a particular feature:
servers are classified into d classes, and we wish to keep approximate balance between the …

Many modern computing workloads are composed of parallelizable jobs. A single
parallelizable job can be completed more quickly if it is run on additional servers, however …

Zero queueing delay is highly desirable in large-scale computing systems. Existing work has
shown that it can be asymptotically achieved by using the celebrated Power-of-d-choices …