Publication
Title
Join-Up-To(m) : improved hyperscalable load balancing
Author
Abstract
Various load balancing policies are known to achieve vanishing waiting times in the large-scale limit, that is, when the number of servers tends to infinity. These policies either require a communication overhead of one message per job or require job size information. Load balancing policies with an overhead below one message per job are called hyperscalable policies. While these policies often have bounded queue length in the large-scale limit and work well when the overhead is somewhat below one, they show poor performance when the communication overhead becomes small, that is, the mean response time tends to infinity when the overhead tends to zero even at low loads. In this paper, we introduce a hyperscalable load balancing policy, called Join-Up-To(m), that remains effective even when the communication overhead tends to zero. To study its performance under general job size distributions, we make use of the "queue at the cavity" approach. We provide explicit results for the first two moments of the response time, the generating function of the queue length distribution and the Laplace transform of the response time. These results show that the mean response time only depends on the first two moments of the job size distribution.
Language
English
Source (journal)
Queueing systems. - Basel, 1986, currens
Publication
Dordrecht : Springer , 2023
ISSN
0257-0130 [print]
1572-9443 [online]
DOI
10.1007/S11134-023-09897-5
Volume/pages
(2023) , p. 1-26
ISI
001103956300001
Full text (Publisher's DOI)
Full text (open access)
The author-created version that incorporates referee comments and is the accepted for publication version Available from 15.05.2024
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identifier
Creation 04.12.2023
Last edited 06.12.2023
To cite this reference