Tight bounds for parallel randomized load balancing

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

Full description

Bibliographic Details
Main Authors: Lenzen, Christoph (Contributor), Wattenhofer, Roger (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Springer-Verlag, 2016-10-20T14:37:54Z.
Subjects:
Online Access:Get fulltext