Randomized load balancing with general service time distributions

Performance Evaluation Review

Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 275-286

  Bramson, Maury ^a   Lu, Yi ^b   Prabhakar, Balaji ^c  

^a UNIVERSITY OF MINNESOTA   (United States)

^b MICROSOFT RESEARCH   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

Asymptotic independence; Load balancing; Randomized algorithms

Indexed keywords

ASYMPTOTIC INDEPENDENCE; EXPONENTIAL SERVERS; FINITE SET; HAZARD RATES; HEAVY-TAILED; LOAD BALANCING MODELS; LOAD-BALANCING; METHOD OF ANALYSIS; MODULARIZED; PERFORMANCE MEASURE; POISSON PROCESS; PROCESSOR SHARING; QUEUE SIZE; QUEUE SIZE DISTRIBUTION; RANDOMIZED ALGORITHMS; RANDOMIZED LOAD BALANCING; SERVICE DISTRIBUTION; SERVICE TIME; SERVICE TIME DISTRIBUTION;

ASYMPTOTIC ANALYSIS; PARALLEL ARCHITECTURES; QUEUEING THEORY; RETAIL STORES; SIZE DISTRIBUTION;

POISSON DISTRIBUTION;

EID: 77954902358     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811071     Document Type: Conference Paper

References (18)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. In SIAM Journal on Computing, pages 593-602, 1994.
2. T. Bonald and A. Proutiere. Insensitivity in processor-sharing networks. Performance Evaluation, 49:193-209, 2002.
3. M. Bramson. Stability of join the shortest queue networks. submitted to the Annals of Probability.
4. C. Graham. Chaoticity on path space for a queueing network with selection of the shortest queue among several. Journal of Appl. Prob., 37:198-211, 2000.
5. C. Graham and S. Méléard. Chaos hypothesis for a system interacting through shared resources. Probab. Theory Relat. Fields, 100:157-173, 1994.
6. F. P. Kelly. Reversiblity and Stochastic Networks. John Wiley and Sons Ltd, 1979.
7. L. Kleinrock. Queueing Systems. Volume1: Theory. Wiley-Interscience, 1975.
8. M. Luczak and C. McDiarmid. On the power of two choices: Balls and bins in continuous time. The Annals of Applied Probability, 15(3):1733-1764, 2005.
9. M. Luczak and C. McDiarmid. On the maximum queue length in the supermarket model. The Annals of Probability, 34(2):493-527, 2006.
10. J. B. Martin and Y. M. Suhov. Fast jackson networks. Ann. Appl. Prob., 9(4):840-854, 1999.
11. M. Mezard, G. Parisi, and M. Virasoro. Spin glass theory and beyond. Physics Today, 41:109, 1988.
12. M. Mitzenmacher. The power of two choices in randomized load balancing. Ph.D. thesis, Berkeley, 1996.
13. M. Mitzenmacher. Studying balanced allocations with differential equations. Combin. Probab. Comput., 8:473-482, 1999.
14. M. Mitzenmacher, A. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. Handbook of Randomized Computing: volume 1. edited by P. Pardalos, S. Rajasekaran, and J. Rolim, pages 255-312, 2001.
15. A. S. Sznitman. Propagation of chaos. Ecole d'ete Saint-Flour. Lect. Notes Math., 1464:165-251, 1989.
16. M. Talagrand. Spin Glasses: A Challenge for Mathematicians. Cavity and Mean Field Models. Springer, 2000.
17. B. Vocking. How asymmetry helps load balancing. In IEEE Symp. Found. Comp. Sci, pages 131-140, 1999.
18. N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich. Queueing system with selection of the shortest of two queues: An asymptotic approach. Probl. Inf. Transm, 32(1):20-34, 1996.