Improved Bounds for Distributed Load Balancing

  title={Improved Bounds for Distributed Load Balancing},
  author={S. Assadi and A. Bernstein and Zachary Langley},
  • S. Assadi, A. Bernstein, Zachary Langley
  • Published in DISC 2020
  • Computer Science
  • 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… CONTINUE READING


    Publications referenced by this paper.
    Distributed 2-Approximation Algorithm for the Semi-matching Problem
    • 21
    Simultaneously Load Balancing for Every p-norm, With Reassignments
    • 6
    • Open Access
    Selfish Load Balancing and Atomic Congestion Games1
    • 15
    • Open Access
    Semi-matchings for Bipartite Graphs and Load Balancing
    • 51
    • Highly Influential
    • Open Access
    Maintaining Assignments Online: Matching, Scheduling, and Flows
    • 39
    Online Bipartite Matching with Amortized O(log 2 n) Replacements
    • 16
    • Open Access
    A data structure for dynamic trees
    • 818
    • Open Access
    The Price of Anarchy for Restricted Parallel Links
    • 36
    • Open Access
    All-norm approximation algorithms
    • 68
    • Highly Influential
    • Open Access
    Improved Distributed Approximate Matching
    • 60
    • Highly Influential
    • Open Access