Graphical balanced allocations and the (1 + β)-choice process

  title={Graphical balanced allocations and the (1 + β)-choice process},
  author={Yuval Peres and Kunal Talwar and Udi Wieder},
  journal={Random Struct. Algorithms},
Suppose m balls are sequentially thrown into n bins where each ball goes into a random bin. It is well-known that the gap between the load of the most loaded bin and the average is ( √ m log n n ), for large m. If each ball goes to the lesser loaded of two random bins, this gap dramatically reduces to (log log n) independent of m. Consider a constrained setting where not all pairs of bins can be sampled. We are given a graph where each node corresponds to a bin. The process sequentially samples… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

Balanced Allocations

View 4 Excerpts
Highly Influenced

"Balls into Bins" - A Simple and Tight Analysis

View 3 Excerpts
Highly Influenced

The Power of Two Choices in Randomized Load Balancing

IEEE Trans. Parallel Distrib. Syst. • 2001
View 1 Excerpt

The power of two random choices: A survey of techniques and results

M. Mitzenmacher, A. W. Richa, R. Sitaraman
Handbook of Randomized Computing, Kluwer, Norwell, MA • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…