Parallel randomized load balancing

Random Structures and Algorithms

Volumn 13, Issue 2, 1998, Pages 159-188

  Adler, Micah ^a   Chakrabarti, Soumen ^b   Mitzenmacher, Michael ^c   Rasmussen, Lars ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032339590     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199809)13:2<159::AID-RSA3>3.0.CO;2-Q     Document Type: Article

References (21)

1. M. Atjai, J. Aspnes, M. Naor, Y. Rabani, L. Schulman, and O. Waarts, Fairness in scheduling, Proceedings of the Sixth Annual ACM/SIAM Symposium on Discrete Algorithms, 1995, pp. 477-485.
2. Y. Azar, A. Broder, A. Karlin, and E. Upfal, Balanced allocations, Proceedings of the Twenty-Sixth ACM Symposium on the Theory of Computing, 1994, pp. 593-602.
3. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Oxford Univ. Press, London, 1992.
4. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, Allocating weighted balls in parallel, Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 302-310.
5. B. Bollobás, Random Graphs, Academic Press, London, 1985.
6. A. Broder, A. Frieze, and E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 322-330.
7. A. Broder and A. Karlin, Multi-level adaptive hashing, Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, 1990.
8. A. Czumaj and V. Stemann, Randomized allocation processes, Proceedings of the Thirty-Eighth Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 194-203.
9. M. Dietzfelbinger and F. Meyer auf der Heide, Simple, efficient shared memory simulations, Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 110-119.
10. G. Gonnet, Expected length of the longest probe sequence in hash code searching, J. ACM, 28(2), 289-304 (April 1981).
11. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Inform. Process. Lett., 33, 305-308 (Feb. 1990).
12. N. Johnson and S. Kotz, Urn Models and Their Application, John Wiley & Sons, New York, 1977.
13. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, Proceedings of the Thirty-Fifth IEEE Symposium on Foundations of Computer Science, 1994.
14. R. M. Karp, M. Luby and F. Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, Proceedings of the Twenty-Fourth ACM Symposium on the Theory of Computing, 1992, pp. 318-326.
15. V. F. Kolchin, B. A. Sevsat'yanov, and V. P. Chistyakov, Random Allocations, V. H. Winston & Sons, New York, 1978.
16. P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, Department of Computer Science TR-94-06, University of Texas at Austin, April 1994, an extended abstract appears in the Proceedings of the Twenty-Sixth ACM Symposium on the Theory of Computing, 1994.
17. F. Meyer auf der Heide, C. Scheideler, and V. Stemann, Exploiting storage redundancy to speed up randomized shared memory simulations, Proceedings of the Twelfth Annual Symposium on Theoretical Aspects of Computer Science, 1995, pp. 267-278.
18. M. Mitzenmacher, Density dependent jump Markov processes and applications to load balancing, Proceedings of the Thirty-Seventh IEEE Symposium on Foundations of Computer Science, 1996, pp. 213-222.
19. M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, Ph.D. thesis, University of California, Berkeley, Sept. 1996.
20. V. Stemann, Contention Resolution Protocols in Hashing Based Shared Memory Simulations, Ph.D. thesis, University of Paderborn, 1995.
21. V. Stemann, Parallel balanced allocations, Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 261-269.