Optimal Load Balancing with Locality Constraints
Optimal Load Balancing with Locality Constraints
复制标题
具有局部性约束的最佳负载平衡
DOI:
10.1145/3428330
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Srikant, R.
中科院分区:
文献类型:
--
作者:
Weng, Wentao;Zhou, Xingyu;Srikant, R.
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 bipartite graph where left nodes correspond to job types and right nodes correspond to servers, with each edge indicating that a job type can be served by a server. Thus edges represent locality constraints, i.e., an arbitrary job can only be served at servers which contain certain data and/or machine learning (ML) models. Servers in this system can have heterogeneous service rates. In this setting, we investigate the performance of two policies named Join-the-Fastest-of-the-Shortest-Queue (JFSQ) and Join-the-Fastest-of-the-Idle-Queue (JFIQ), which are simple variants of Join-the-Shortest-Queue and Join-the-Idle-Queue, where ties are broken in favor of the fastest servers. Under a "well-connected'' graph condition, we show that JFSQ and JFIQ are asymptotically optimal in the mean response time when the number of servers goes to infinity. In addition to asymptotic optimality, we also obtain upper bounds on the mean response time for finite-size systems. We further show that the well-connectedness condition can be satisfied by a random bipartite graph construction with relatively sparse connectivity.
登录
查看更多内容
DOI:
--
发表时间:
2018
期刊:
Proceedings of the ACM on Measurement and Analysis of Computing Systems
影响因子:
--
作者:
Xingyu Zhou;Jian Tan;N. Shroff
通讯作者:
N. Shroff
影响因子:
1.7
作者:
Anton Braverman
通讯作者:
Anton Braverman
影响因子:
1.1
作者:
Hurtado-Lange, Daniela;Maguluri, Siva Theja
通讯作者:
Maguluri, Siva Theja
影响因子:
--
作者:
Debankur Mukherjee;S. Borst;J. V. van Leeuwaarden;P. Whiting
通讯作者:
P. Whiting
DOI:
--
发表时间:
2014
期刊:
影响因子:
--
作者:
A. Stolyar
通讯作者:
A. Stolyar