## The Power of Two Choices in Randomized Load Balancing (1996)

### Cached

### Download Links

- [www.research.digital.com]
- [cs-www.bu.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |

Citations: | 202 - 22 self |

### BibTeX

@TECHREPORT{Mitzenmacher96thepower,

author = {Michael David Mitzenmacher},

title = {The Power of Two Choices in Randomized Load Balancing},

institution = {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

Suppose that n balls are placed into n bins, each ball being placed into a bin chosen independently and uniformly at random. Then, with high probability, the maximum load in any bin is approximately log n log log n . Suppose instead that each ball is placed sequentially into the least full of d bins chosen independently and uniformly at random. It has recently been shown that the maximum load is then only log log n log d +O(1) with high probability. Thus giving each ball two choices instead of just one leads to an exponential improvement in the maximum load. This result demonstrates the power of two choices, and it has several applications to load balancing in distributed systems. In this thesis, we expand upon this result by examining related models and by developing techniques for stu...