Tight bounds for parallel randomized load balancing: extended abstract

@inproceedings{Lenzen2011TightBF,
  title={Tight bounds for parallel randomized load balancing: extended abstract},
  author={Christoph Lenzen and Roger Wattenhofer},
  booktitle={STOC},
  year={2011}
}
We explore the fundamental limits of distributed balls-into-bins algorithms, i.e., algorithms where balls act in parallel, as separate agents. This problem was introduced by Adler et al., who showed that non-adaptive and symmetric algorithms cannot reliably perform better than a maximum bin load of Theta(log log n / log log log n) within the same number of rounds. We present an adaptive symmetric algorithm that achieves a bin load of two in log* n+O(1) communication rounds using O(n) messages… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…