Asymptotic Optimality of Speed-Aware JSQ for Heterogeneous Systems

03/03/2022
by   Sanidhay Bhambay, et al.
0

The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise the average delay of jobs in homogeneous systems consisting of identical servers. However, it performs poorly in heterogeneous systems where servers have different processing rates. Finding a delay optimal scheme remains an open problem for heterogeneous systems. In this paper, we consider a speed-aware version of the JSQ scheme for heterogeneous systems and show that it achieves delay optimality in the fluid limit. One of the key issues in establishing this optimality result for heterogeneous systems is to show that the sequence of steady-state distributions indexed by the system size is tight in an appropriately defined space. The usual technique for showing tightness by coupling with a suitably defined dominant system does not work for heterogeneous systems. To prove tightness, we devise a new technique that uses the drift of exponential Lyapunov functions. Using the non-negativity of the drift, we show that the stationary queue length distribution has an exponentially decaying tail - a fact we use to prove tightness. Another technical difficulty arises due to the complexity of the underlying state-space and the separation of two time-scales in the fluid limit. Due to these factors, the fluid-limit turns out to be a function of the invariant distribution of a multi-dimensional Markov chain which is hard to characterise. By using some properties of this invariant distribution and using the monotonicity of the system, we show that the fluid limit is has a unique and globally attractive fixed point.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2020

Scalable Load Balancing in the Presence of Heterogeneous Servers

Heterogeneity is becoming increasingly ubiquitous in modern large-scale ...
research
06/08/2018

Flexible Load Balancing with Multi-dimensional State-space Collapse: Throughput and Heavy-traffic Delay Optimality

Heavy traffic analysis for load balancing policies has relied heavily on...
research
02/20/2020

Asymptotically Optimal Load Balancing in Large-scale Heterogeneous Systems with Multiple Dispatchers

We consider the load balancing problem in large-scale heterogeneous syst...
research
12/25/2019

Large fork-join networks with nearly deterministic service times

In this paper, we study an N server fork-join queueing network with near...
research
02/16/2022

Large-System Insensitivity of Zero-Waiting Load Balancing Algorithms

This paper studies the sensitivity (or insensitivity) of a class of load...
research
03/20/2018

Join-Idle-Queue with Service Elasticity: Large-Scale Asymptotics of a Non-monotone System

We consider the model of a token-based joint auto-scaling and load balan...
research
12/18/2020

Learning and balancing time-varying loads in large-scale systems

Consider a system of n parallel server pools where tasks arrive as a tim...

Please sign up or login with your details

Forgot password? Click here to reset