Advertisement
Published in:
2015 | OriginalPaper | Chapter
Locally Optimal Load Balancing
Authors : Laurent Feuilloley, Juho Hirvonen, Jukka Suomela
Published in: Distributed Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This work studies distributed algorithms for
locally optimal load-balancing
: We are given a graph of maximum degree
$\varDelta$
, and each node has up to
L
units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (
$\varDelta = 2$
), it is easy to solve the
fractional
version of the problem in
O
(
L
) communication rounds, independently of the number of nodes. We show that this is tight, and we show that it is possible to solve also the
discrete
version of the problem in
O
(
L
) rounds in paths. For the general case (
$\varDelta > 2$
), we show that fractional load balancing can be solved in
${\rm poly}(L,\varDelta)$
rounds and discrete load balancing in
$f(L,\varDelta)$
rounds for some function
f
, independently of the number of nodes.