The Power of Two Choices in Randomized Load Balancing

@article{Mitzenmacher2001ThePO,
  title={The Power of Two Choices in Randomized Load Balancing},
  author={M. Mitzenmacher},
  journal={IEEE Trans. Parallel Distributed Syst.},
  year={2001},
  volume={12},
  pages={1094-1104}
}
  • M. Mitzenmacher
  • Published 2001
  • Computer Science
  • IEEE Trans. Parallel Distributed Syst.
  • 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
    1,111 Citations
    Randomized load balancing with general service time distributions
    • 148
    • PDF
    Load Balancing in Stochastic Networks: Algorithms, Analysis, and Game Theory
    • 5
    • Highly Influenced
    • PDF
    Power-of-$d$-Choices with Memory: Fluid Limit and Optimality
    • 3
    On the Analysis of Randomized Load Balancing Schemes
    • M. Mitzenmacher
    • Computer Science, Mathematics
    • Theory of Computing Systems
    • 1999
    • 85
    • PDF
    Asymptotic Optimality of Balanced Routing
    • 27
    • Highly Influenced
    • PDF
    Join-Idle-Queue system with general service times: Large-scale limit of stationary distributions
    • 2
    • PDF
    The Power of Two Choices on Graphs: the Pair-Approximation is Accurate?
    • 20
    • PDF
    The use of memory in randomized load balancing
    • D. Shah, B. Prabhakar
    • Computer Science
    • Proceedings IEEE International Symposium on Information Theory,
    • 2002
    • 16
    • PDF
    A lower bound on the queueing delay in resource constrained load balancing
    • 2
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 154 REFERENCES
    Load balancing and density dependent jump Markov processes
    • M. Mitzenmacher
    • Computer Science
    • Proceedings of 37th Conference on Foundations of Computer Science
    • 1996
    • 100
    • PDF
    On the Analysis of Randomized Load Balancing Schemes
    • M. Mitzenmacher
    • Computer Science, Mathematics
    • Theory of Computing Systems
    • 1999
    • 85
    • PDF
    Analysis of the asymmetric shortest queue problem
    • 110
    • PDF
    How Useful Is Old Information?
    • 239
    • PDF
    Adaptive Load Sharing in Heterogeneous Distributed Systems
    • 129
    The power of two random choices: a survey of tech-niques and results
    • 382
    • PDF
    Average delay in queues with non-stationary Poisson arrivals
    • 87
    • PDF