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 …

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 …

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 …

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 …

The problem of online scheduling of multi-server jobs is considered, where there are a total
of K servers, and each job requires concurrent service from multiple servers for it to be …

Multiserver queueing theory emphasizes one-server-per-job models, such as the M/G/k.
Such models were popular for decades in the study of computing systems. However …

We study a Multiserver Job Queuing Model (MJQM), ie, a FIFO (First-In-First-Out) queue in
which jobs request varying numbers of servers. Our investigation focuses on the saturation …

Internet service providers (ISPs) have a variety of quality attributes that determine their
attractiveness for data transmission, ranging from quality-of-service metrics such as jitter to …

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 is First …

We present a novel empirical method of stochastic stability evaluation of non-Markovian
queueing models. We use this method to evaluate the stability of the multiserver job model …