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 queueing systems are found at the core of a wide variety of practical systems.
Many important multiserver models have a previously-unexplained similarity: identical mean …

In this paper, we analyse a queueing model with two types of requests arriving in a marked
Markov arrival process. Type-1 requests require a constant service rate, while type-2 …

In this paper, we study scheduling of a queueing system with zero knowledge of
instantaneous network conditions. We consider a one-hop single-server queueing system …

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) …

In this paper, we study systems where each job or request can be split into a flexible number
of sub-jobs up to a maximum limit. The number of sub-jobs a job is split into depends on the …

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 …

Parallelizable workloads are ubiquitous and appear across a diverse array of modern
computer systems. Data centers, supercomputers, machine learning clusters, distributed …

In this paper, we study scheduling of a queueing system with zero knowledge of
instantaneous network conditions. We consider a one-hop single-server queueing system …

Modern data centers feature an extensive array of cores that handle quite a diverse range of
jobs. Recent traces, shared by leading cloud data center enterprises like Google and …