Balanced allocations: The heavily loaded case

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 745-754

  Berenbrink, Petra ^a   Czumaj, Artur ^b   Steger, Angelika ^c   Vöcking, Berthold ^d  

^a UNIVERSITY OF PADERBORN   (Germany)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^d UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED ALLOCATION; BALANCING PROCESS; COMPARATIVE STUDIES; GREEDY SCHEME; LOAD BALANCE; MAXIMUM LOAD; OPTIMAL ALLOCATION; RANDOMIZED PROCESS; BALANCED ALLOCATIONS;

BINS; OPTIMIZATION; PARALLEL ARCHITECTURES; ALGORITHMS; COMPUTATIONAL COMPLEXITY;

COMPUTATION THEORY; COMPUTER OPERATING SYSTEMS;

EID: 0033705066     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335411     Document Type: Conference Paper

References (13)

1. Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. Theoretical Computer Science, 130: 73-84, 1994.
2. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM J. Comput., 29( 1): 180-200, September 1999.
3. A preliminary version appeared in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 593-602, Montreal, Quebec, Canada, May 23-25, 1994. ACM Press, New York, NY.
4. D. Aldous. Random walks of finite groups and rapidly mixing Markov chains. In J. Azéma and M. Yor, editors, Séminaire de Probabilités XVII, 1981/82, volume 986 of Lecture Notes in Mathematics, pages 243-297. Springer-Verlag, Berlin, 1983.
5. R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing in Markov chains. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 223-231, Miami Beach, FL, October 19-22, 1997. IEEE Computer Society Press, Los Alamitos, CA.
6. A. Czumaj. Non-Markovian couplings and generating permutations via random transpositions. Manuscript, February 2000.
7. D. Dubhashi and D. Ranjan. Balls and bins: A study in negative dependence. Random Structures & Algorithms, 13( 2): 99-124 1998.
8. M. Mitzenmacher. Load balancing and density dependent jump Markov processes. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 213-222, Burlington, Vermont, October 14-16, 1996. IEEE Computer Society Press, Los Alamitos, CA.
9. M. D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, Computer Science Department, University of California at Berkeley, September 1996.
10. M. Raab and A. Steger. "Balls into bins" - a simple and tight analysis . In M. Luby, J. Rolim, and M. Serna, editors, Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 159-170, Barcelona, Spain, October 8-10, 1998. Springer-Verlag, Berlin.
11. N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich. Queueing system with selection of the shortest of two queues: An assymptotic approach. Problems of Information Transmission, 32( 1): 15-27, January-March 1996.
12. B. Vöcking. How asymetry helps load balancing. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 131-141, New York City, NY, October 17-19, 1999. IEEE Computer Society Press, Los Alamitos, CA.
13. N. D. Vvedenskaya and Y. M. Suhov. Dobrushin's mean-field approximation for queue with dynamic Technical Report No 3328, INRIA, France, December 1997.