Improved bounds for distributed load balancing

Sepehr Assadi, Aaron Bernstein, Zachary Langley

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

In the load balancing problem, the input is an n-vertex bipartite graph G = (C ∪ S, E) - where the two sides of the bipartite graph are referred to as the clients and the servers - and a positive weight for each client c ∈ C. The algorithm must assign each client c ∈ C to an adjacent server s ∈ S. The load of a server is then the weighted sum of all the clients assigned to it. The goal is to compute an assignment that minimizes some function of the server loads, typically either the maximum server load (i.e., the '∞-norm) or the 'p-norm of the server loads. This problem has a variety of applications and has been widely studied under several different names, including: scheduling with restricted assignment, semi-matching, and distributed backup placement. We study load balancing in the distributed setting. There are two existing results in the CONGEST model. Czygrinow et al. [DISC 2012] showed a 2-approximation for unweighted clients with round-complexity O(∆5), where ∆ is the maximum degree of the input graph. Halldórsson et al. [SPAA 2015] showed an O(log n/log log n)-approximation for unweighted clients and O(log2n/log log n)approximation for weighted clients with round-complexity polylog(n). In this paper, we show the first distributed algorithms to compute an O(1)-approximation to the load balancing problem in polylog(n) rounds: In the CONGEST model, we give an O(1)-approximation algorithm in polylog(n) rounds for unweighted clients. For weighted clients, the approximation ratio is O(log n). In the less constrained LOCAL model, we give an O(1)-approximation algorithm for weighted clients in polylog(n) rounds. Our approach also has implications for the standard sequential setting in which we obtain the first O(1)-approximation for this problem that runs in near-linear time. A 2-approximation is already known, but it requires solving a linear program and is hence much slower. Finally, we note that all of our results simultaneously approximate all 'p-norms, including the '∞-norm.

Original languageEnglish (US)
Title of host publication34th International Symposium on Distributed Computing, DISC 2020
EditorsHagit Attiya
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771689
DOIs
StatePublished - Oct 1 2020
Event34th International Symposium on Distributed Computing, DISC 2020 - Virtual, Online
Duration: Oct 12 2020Oct 16 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume179
ISSN (Print)1868-8969

Conference

Conference34th International Symposium on Distributed Computing, DISC 2020
CityVirtual, Online
Period10/12/2010/16/20

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Distributed algorithms
  • Load balancing
  • Matching
  • Semi-Matching

Fingerprint

Dive into the research topics of 'Improved bounds for distributed load balancing'. Together they form a unique fingerprint.

Cite this