The BAR approach for multiclass queueing networks with SBP service policies
The basic adjoint relationship (BAR) approach is an analysis technique based on the
stationary equation of a Markov process. This approach was introduced to study heavy …
stationary equation of a Markov process. This approach was introduced to study heavy …
Optimal load balancing with locality constraints
Applications in cloud platforms motivate the study of efficient load balancing under job-
server constraints and server heterogeneity. In this paper, we study load balancing on a …
server constraints and server heterogeneity. In this paper, we study load balancing on a …
Zero queueing for multi-server jobs
Cloud computing today is dominated by multi-server jobs. These are jobs that request
multiple servers simultaneously and hold onto all of these servers for the duration of the job …
multiple servers simultaneously and hold onto all of these servers for the duration of the job …
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 …
Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime
We study a class of load-balancing algorithms for many-server systems (N servers). Each
server has a buffer of size (ra positive integer). The proof of the main result is based on the …
server has a buffer of size (ra positive integer). The proof of the main result is based on the …
Transform methods for heavy-traffic analysis
D Hurtado-Lange, ST Maguluri - Stochastic Systems, 2020 - pubsonline.informs.org
The drift method was recently developed to study queuing systems in steady state. It was
used successfully to obtain bounds on the moments of the scaled queue lengths that are …
used successfully to obtain bounds on the moments of the scaled queue lengths that are …
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 …
Load balancing under strict compatibility constraints
D Rutten, D Mukherjee - Mathematics of Operations …, 2023 - pubsonline.informs.org
Consider a system with N identical single-server queues and a number of task types, where
each server is able to process only a small subset of possible task types. Arriving tasks …
each server is able to process only a small subset of possible task types. Arriving tasks …
Flexible load balancing with multi-dimensional state-space collapse: Throughput and heavy-traffic delay optimality
Heavy traffic delay analysis for load balancing policies has relied heavily on a condition
called state-space collapse onto a single-dimensional line. In this paper, via Lyapunov …
called state-space collapse onto a single-dimensional line. In this paper, via Lyapunov …
Heavy traffic distribution of queueing systems without resource pooling
P Jhunjhunwala, ST Maguluri - arXiv preprint arXiv:2206.06504, 2022 - arxiv.org
This paper studies the heavy-traffic joint distribution of queue lengths in two stochastic
processing networks (SPN), viz., an input-queued switch operating under the MaxWeight …
processing networks (SPN), viz., an input-queued switch operating under the MaxWeight …