Tight bounds for parallel randomized load balancing
Name
446_2014_Article_225.pdf
Size
582.6 KB
Format
Adobe PDF
Checksum (MD5)
6e7014df1b895dc30180348902ba54f9
Author(s)
Lenzen, Christoph
Wattenhofer, Roger
Date Issued
July 2014
Journal
Distributed Computing
Publisher
Springer-Verlag
Citation
Lenzen, Christoph, and Roger Wattenhofer."Tight bounds for parallel randomized load balancing." Distributed Computing, vol. 29, no. 2, July 2014, pp. 127-142.
Version
Author's final manuscript
Abstract
Given a distributed system of n balls and n bins, how evenly can we distribute the balls to the bins, minimizing communication? The fastest non-adaptive and symmetric algorithm achieving a constant maximum bin load requires Θ(loglogn) rounds, and any such algorithm running for r∈O(1) rounds incurs a bin load of Ω((logn/loglogn)1/r). In this work, we explore the fundamental limits of the general problem. We present a simple adaptive symmetric algorithm that achieves a bin load of 2 in log∗n+O(1) communication rounds using O(n) messages in total. Our main result, however, is a matching lower bound of (1−o(1))log∗n on the time complexity of symmetric algorithms that guarantee small bin loads. The essential preconditions of the proof are (i) a limit of O(n) on the total number of messages sent by the algorithm and (ii) anonymity of bins, i.e., the port numberings of balls need not be globally consistent. In order to show that our technique yields indeed tight bounds, we provide for each assumption an algorithm violating it, in turn achieving a constant maximum bin load in constant time.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00446-014-0225-4
