The Power of Two Choices in Randomized Load Balancing

@article{Mitzenmacher2001ThePO,
  title={The Power of Two Choices in Randomized Load Balancing},
  author={Michael Mitzenmacher},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={2001},
  volume={12},
  pages={1094-1104}
}
We consider the following natural model: customers arrive as a Poisson stream of rate /spl lambda/n, /spl lambda/<1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers and waits for service at the one with the fewest customers. Customers are served according to the first-in first-out (FIFO) protocol and the service time for a customer is exponentially distributed with mean 1. We call this problem the supermarket… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 741 CITATIONS

Scalable Load Balancing Algorithms in Networked Systems

VIEW 9 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Redundancy-d: The Power of d Choices for Redundancy

VIEW 16 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Balancing Load When Service times Are Heavy-tailed

VIEW 24 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2019

CITATION STATISTICS

  • 101 Highly Influenced Citations

  • Averaged 77 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 69 REFERENCES

Balanced Allocations

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

and F

R. M. Karp, M. Luby
  • Meyer auf der Heide. E cient PRAM simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on the Theory of Computing, pages 318{326
  • 1992
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Approximation of Population Processes

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Limit theorems for sequences of jump Markov processes approximating ordinary di erential processes

T. G. Kurtz
  • Journal of Applied Probability, 8:344{356
  • 1971
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL