
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael Mitzenmacher, "The Power of Two Choices in Randomized Load Balancing," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 10, pp. 10941104, October, 2001.  
BibTex  x  
@article{ 10.1109/71.963420, author = {Michael Mitzenmacher}, title = {The Power of Two Choices in Randomized Load Balancing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {10}, issn = {10459219}, year = {2001}, pages = {10941104}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.963420}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The Power of Two Choices in Randomized Load Balancing IS  10 SN  10459219 SP1094 EP1104 EPD  10941104 A1  Michael Mitzenmacher, PY  2001 KW  Load balancing KW  queuing theory KW  distributed systems KW  limiting systems KW  choices. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We consider the following natural model: Customers arrive as a Poisson stream of rate
[1] Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal, Balanced Allocations Proc. 26th ACM Symp. Theory of Computing, pp. 593602, 1994.
[2] M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, “Parallel Randomized Load Balancing,” Proc. 27th ACM Symp. Theory of Computing, pp. 238247, 1995.
[3] D. Achlioptas and M. Molloy, “The Analysis of a ListColoring Algorithm on a Random Graph,” Proc. 38th IEEE Symp. Foundations of Computer Science, 1997.
[4] A. Bestavros, “Load Profiling: A Methodology for Scheduling RealTime Tasks in a Distributed System,” Proc. ICDCS '97: IEEE Int'l Conf. Distributed Computing Systems, May 1997.
[5] M. Dahlin, Serverless Network File Systems, PhD dissertation, University of Calif. at Berkeley, Computer Science Dept., 1995.
[6] K. Deimling, “Ordinary Differential Equations in Banach Spaces,” Lecture Notes in Math., vol. 96, 1977.
[7] S.N. Ethier and T.G. Kurtz, Markov Processes: Characterization and Convergence. John Wiley and Sons, 1986.
[8] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "Adaptive Load Sharing in Homogeneous Distributed Systems," IEEE Trans. Software Eng., vol. 12, no. 5, pp. 662675, May 1986.
[9] D.L. Eager, E.D. Lazowska, and J. Zahorjan, "A Comparison of ReceiverInitiated and SenderInitiated Adaptive Load Sharing," Performance Evaluation, Vol. 6, Mar. 1986, pp. 5368.
[10] B. Hajek, “Asymptotic Analysis of an Assignment Problem Arising in a Distributed Communications Protocol,” Proc. 27th Conf. Decision and Control, pp. 14551459, 1988.
[11] R.M. Karp, M. Luby, and F. Meyer auf der Heide, Efficient PRAM Simulation on a Distributed Memory Machine Proc. 24th ACM Symp. Theory of Computing, pp. 318326, May 1992.
[12] R.M. Karp and M. Sipser, “Maximum Matchings in Sparse Random Graphs,” Proc. 22nd IEEE Symp. Foundations of Computer Science, pp. 364375, 1981.
[13] R.M. Karp, U.V. Vazirani, and V.V. Vazirani, “An Optimal Algorithm for OnLine Bipartite Matching,” Proc. 22nd ACM Symp. Theory of Computing, pp. 352358, 1990.
[14] T.G. Kurtz, “Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes,” J. Applied Probability, vol. 7, pp. 4958, 1970.
[15] T.G. Kurtz, “Limit Theorems for Sequences of Jump Markov Processes Approximating Ordinary Differential Processes,” J. Applied Probability, vol. 9, pp. 344356, 1971.
[16] T.G. Kurtz, “Strong Approximation Theorems for Density Dependent Markov Chains,” Stochastic Processes and Applications, vol. 6, pp. 223240, 1978.
[17] T.G. Kurtz, Approximation of Population Processes. SIAM Press, 1981.
[18] M. Luby, M. Mitzenmacher, M.A. Shokrollahi, D. Spielman, and V. Stemann, “Practical LossResilient Codes,” Proc. 29th ACM Symp. Theory of Computing, pp. 150159, 1997.
[19] P.D. MacKenzie, C.G. Plaxton, and R. Rajaraman, “On Contention Resolution Protocols and Associated Probabilistic Phenomena,” J. ACM, vol. 45, no. 2, pp. 324378, 1998.
[20] R. Abraham, J. Marsden, and T. Raitu, Manifolds, Tensor Analysis, and Applications. AddisonWesley, 1983.
[21] A.N. Michel and R.K. Miller, “Qualitative Analysis of Large Scale Dynamical Systems,” Math. Science and Eng., vol. 134, 1977.
[22] R. Mirchandaney, D. Towsley, and J.A. Stankovic, "Analysis of the Effect of Delays on Load Sharing," IEEE Trans. Computers, vol. 38, no. 11, pp. 1,5131,525, Nov. 1989.
[23] R. Mirchandaney, D. Towsley, and J.A. Stankovic, "Adaptive Load Sharing in Heterogeneous Distributed Systems," J. Parallel and Distributed Computing, Vol. 9, 1990, pp. 331346.
[24] M. Mitzenmacher, “Load Balancing and Density Dependent Jump Markov Processes,” Proc. 37th IEEE Symp. Foundations of Computer Science, pp. 213222, 1996.
[25] M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing PhD thesis, Univ. of California Berkeley, 1996.
[26] M. Mitzenmacher, “On the Analysis of Randomized Load Balancing Schemes,” Theory of Computing Systems, vol. 32, pp. 361386, 1999.
[27] M. Michael, How Useful Is Old Information? IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 1, pp. 620, Jan. 2000.
[28] M. Mitzenmacher, A. Richa, and R. Sitaraman, “The Power of Two Random Choices: A Survey of Techniques and Results,” Handbook of Randomized Computing, vol. 1, June 2001.
[29] B. Pittel, J. Spencer, and N. Wormald, “Sudden Emergence of a Giant kCore in a Random Graph,” J. Combinatorial Theory, Series B, vol. 67, pp. 111151, 1996.
[30] J.R. Santos and R. Muntz, “Design of the RIO (Randomized I/O) Storage Server,” technical report, Computer Science Dept., Univ. of Calif., Los Angeles, May 1997.
[31] A. Shwartz and A. Weiss, Large Deviations for Performance Analysis. Chapman and Hall, 1995.
[32] V. Stemann, “Parallel Balanced Allocations,” Proc. Eighth Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 261269, 1996.
[33] N.D. Vvedenskaya, R.L. Dobrushin, and F.I. Karpelevich, “Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach,” Problems of Information Transmission, vol. 32, pp. 1527, 1996.
[34] R. Weber, “On the Optimal Assignment of Customers to Parallel Servers,” J. Applied Probability, vol. 15, pp. 406413, 1978.
[35] W. Winston, “Optimality of the Shortest Line Discipline” J. Applied Probability, vol. 14, pp. 181189, 1977.
[36] N.C. Wormald, “Differential Equations for Random Processes and Random Graphs,” Annals of Applied Probability, vol. 5, pp. 12171235, 1995.
[37] S. Zhou, "A TraceDriven Simulation Study of Dynamic Load Balancing," IEEE Trans. Software Eng., vol. 14, no. 9, pp. 1,3271,341, Sept. 1988.