Improved Bounds for Distributed Load Balancing

  title={Improved Bounds for Distributed Load Balancing},
  author={Sepehr Assadi and Aaron Bernstein and Zachary Langley},
In the load balancing problem, the input is an $n$-vertex bipartite graph $G = (C \cup S, E)$ and a positive weight for each client $c \in C$. The algorithm must assign each client $c \in C$ to an adjacent server $s \in 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 $\ell_{\infty}$-norm) or the $\ell_p$-norm of the… Expand
Distributed Load Balancing: A New Framework and Improved Guarantees
This paper presents a new distributed algorithm that works with any symmetric non-decreasing convex function for evaluating the balancedness of the workers’ load and introduces several new twists to deal with general convex objectives. Expand
On the Complexity of Load Balancing in Dynamic Networks
This paper shows that randomness is not necessary, and presents a deterministic algorithm which slightly improves the running time of the previous algorithm, at the price of not being matching-based, suggesting that load-balancing in real world systems might be faster than the lower bounds suggest. Expand
Efficient Load-Balancing through Distributed Token Dropping
This work uses the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings and introduces a new graph problem, thetoken dropping game, and shows how to solve it efficiently in a distributed setting. Expand
Stochastic Coordination in Heterogeneous Load Balancing Systems
The load balancing problem is formulated as a stochastic optimization problem, and an efficient algorithmic solution is obtained based on a subtle mathematical analysis of the problem that outperforms previous solutions. Expand


Simultaneously Load Balancing for Every p-norm, With Reassignments
This paper investigates the task of load balancing where the objective function is to minimize the p-norm of loads, for p\geq 1, in both static and incremental settings. We consider two closelyExpand
Distributed 2-Approximation Algorithm for the Semi-matching Problem
This paper considers the problem of matching clients with servers, each of which can process a subset of clients, and gives a fast algorithm for the case when Δ is large and the degrees in V and U satisfy some additional properties. Expand
Simpler and Better Algorithms for Minimum-Norm Load Balancing
Recently, Chakrabarty and Swamy (STOC 2019) introduced the {\em minimum-norm load-balancing} problem on unrelated machines, wherein we are given a set $J$ of jobs that need to be scheduled on a setExpand
Selfish Load Balancing and Atomic Congestion Games
This work revisits a classical load balancing problem in the modern context of decentralized systems and self-interested clients and proves nearly tight bounds on the price of anarchy (worst-case ratio between a Nash solution and the social optimum) for linear latency functions. Expand
Approximation schemes for scheduling
This work considers the classic scheduling/load balancing problems where there are m identical machines and n jobs, and each job should be assigned to some machine, and provides an c-approximation scheme for the general L{ sub p} norm (and in particular for the L{sub 2} norm). Expand
Selfish Load Balancing and Atomic Congestion Games1
We revisit a classical load balancing problem in the modern context of decentralized systems and self-interested clients. In particular, there is a set of clients, each of whom must choose a serverExpand
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization
This paper devise an algorithm for dense graph topologies, including unit disk graphs, unit ball graphs, line graphs, graphs with bounded diversity, and many more, and is very simple as well, in sharp contrast to previous algorithms that compute such a solution within this running time. Expand
Maintaining Assignments Online: Matching, Scheduling, and Flows
This work shows that for edge-orientation, one can achieve a constant-competitive load while doing only a constant number of re-orientations per edge (in an amortized sense) and extend this to restricted machine scheduling with arbitrary sized jobs and give an algorithm that maintains load which is O(log log mn) times the optimum, and reassigns each job only an (amortized) constant amount of times. Expand
Improved Distributed Approximate Matching
A distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times and another algorithm which provides (½-ε) approximation in general graphs in O(logε-1log n) time, improving on the previously known algorithms. Expand
The Price of Anarchy for Restricted Parallel Links
This work presents a comprehensive collection of bounds on Price of Anarchy for the model of restricted parallel links and for the special case of pure Nash equilibria. Expand