Datacenter operations today provide a plethora of new queueing and scheduling problems.
The notion of a “job” has become more general and multi-dimensional. The ways in which …

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 …

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

Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …

Dispatching systems, where arriving jobs are immediately assigned to one of multiple
queues, are ubiquitous in computer systems and service systems. A natural and practically …

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 …

Scheduling theory is a key tool for reducing latency (ie response time) in queueing systems.
Scheduling, ie choosing the order in which to serve jobs, can reduce response time by an …

Load balancing plays a crucial role in many large scale computer systems. Much prior work
has focused on systems with First-Come-First-Served (FCFS) servers. However, servers in …

We consider a practically motivated variant of the canonical online fair allocation problem: a
decision-maker has a budget of resources to allocate over a fixed number of rounds. Each …

We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with
light-tailed job sizes, to asymptotically optimize the response time tail. This means …