Improved Bounds for Distributed Load Balancing

Zachary Langley
Zachary Langley

DISC, 2020.

Cited by: 0|Bibtex|Views8|DOI:https://doi.org/10.4230/LIPIcs.DISC.2020.1
EI
Other Links: arxiv.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

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 assignm...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments