Tight bounds for parallel randomized load balancing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 11-20

  Lenzen, Christoph ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

asymptotic bounds; load balancing; randomized allocation

Indexed keywords

GRAPH STRUCTURES; GRAPH THEORY; RESOURCE ALLOCATION;

ASYMPTOTIC BOUNDS; ASYMPTOTICALLY OPTIMAL; COMMUNICATION ROUNDS; FOLLOWING PROBLEM; MESSAGE COMPLEXITY; RANDOMIZED ALLOCATION; RANDOMIZED LOAD BALANCING; SYMMETRIC ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 79959694300     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993639     Document Type: Conference Paper

References (41)

1. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel Randomized Load Balancing. In Proc. 27th Symposium on Theory of Computing (STOC), pages 238-247, 1995.
2. p Norm. In Proc. 36th Symposium on Foundations of Computer Science (FOCS), pages 383-391, 1995.
3. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced Allocations. SIAM Journal on Computing, 29(1):180-200, 1999. (Pubitemid 30588356)
4. H. Bast and T. Hagerup. Fast and Reliable Parallel Hashing. In Proc. 3rd Symposium on Parallel Algorithms and Architectures (SPAA), pages 50-61, 1991.
5. P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. W. Goldberg, Z. Hu, and R. Martin. Distributed Selfish Load Balancing. SIAM Journal on Computing, 37(4):1163-1181, 2007.
6. P. Berenbrink, T. Friedetzky, Z. Hu, and R. Martin. On Weighted Balls-into-Bins Games. Theoretical Computer Science, 409(3):511-520, 2008.
7. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder. Allocating Weighted Jobs in Parallel. In Proc. 9th Symposium on Parallel Algorithms and Architectures (SPAA), pages 302-310, 1997.
8. A. Czumaj and V. Stemann. Randomized Allocation Processes. Random Structures and Algorithms, 18(4):297-331, 2001.
9. A. Czygrinow, M. Hańćkowiak, and W. Wawrzyniak. Fast Distributed Approximations in Planar Graphs. In Proc. 22nd Symposium on Distributed Computing (DISC), pages 78-92, 2008.
10. D. Dubhashi and D. Ranjan. Balls and Bins: A Study in Negative Dependence. Random Structures and Algorithms, 13:99-124, 1996.
11. G. Even and M. Medina. Revisiting Randomized Parallel Load Balancing Algorithms. In Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 209-221, 2009.
12. G. Even and M. Medina. Parallel Randomized Load Balancing: A Lower Bound for a More General Model. In Proc. 36th Conference on Theory and Practice of Computer Science (SOFSEM), pages 358-369, 2010.
13. F. Fich and E. Ruppert. Hundreds of Impossibility Results for Distributed Computing. Distributed Computing, 16(2-3):121-163, 2003.
14. J. Gil, F. M. auf der Heide, and A. Wigderson. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 25(5):936-955, 1996. (Pubitemid 126558685)
15. G. H. Gonnet. Expected Length of the Longest Probe Sequence in Hash Code Searching. Journal of the ACM, 28(2):289-304, 1981.
16. T. Hagerup. The Log-Star Revolution. In Proc. 9th Symposium on Theoretical Aspects of Computer Science (STACS), pages 259-278, 1992.
17. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica, 16:517-542, 1996. (Pubitemid 126416940)
18. K. Kenthapadi and R. Panigrahy. Balanced Allocation on Graphs. In Proc. 7th Symposium on Discrete Algorithms (SODA), pages 434-443, 2006.
19. R. Kleinberg, G. Piliouras, and E. Tardos. Load Balancing without Regret in the Bulletin Board Model. In Proc. 28th Symposium on Principles of Distributed Computing (PODC), pages 56-62, 2009.
20. E. Koutsoupias, M. Mavronicolas, and P. G. Spirakis. Approximate Equilibria and Ball Fusion. Theory of Computing Systems, 36(6):683-693, 2003. (Pubitemid 38000603)
21. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! Computing Research Repository, abs/1011.5470, 2010.
22. C. Lenzen and R. Wattenhofer. Leveraging Linial's Locality Limit. In Proc. 22nd Symposium on Distributed Computing (DISC), pages 394-407, 2008.
23. C. Lenzen and R. Wattenhofer. Tight Bounds for Parallel Randomized Load Balancing. Computing Research Repository, abs/1102.5425, 2011.
24. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
25. Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for Constant Diameter Graphs. Distributed Computing, 18(6), 2006.
26. N. Lynch. A Hundred Impossibility Proofs for Distributed Computing. In Proc. 8th Symposium on Principles of distributed computing (PODC), pages 1-28, 1989.
27. Y. Matias and U. Vishkin. Converting High Probability into Nearly-Constant Time - with Applications to Parallel Hashing. In Proc. 23rd Symposium on Theory of Computing (STOC), pages 307-316, 1991.
28. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theoretical Computer Science, 162(2):245-281, 1996.
29. M. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California, Berkeley, 1996.
30. M. Mitzenmacher. How Useful is Old Information? Technical report, Systems Research Center, Digital Equipment Corporation, 1998.
31. M. Mitzenmacher. On the Analysis of Randomized Load Balancing Schemes. In Proc. 10th Symposium on Parallel Algorithms and Architectures (SPAA), pages 292-301, 1998.
32. M. Mitzenmacher, B. Prabhakar, and D. Shah. Load Balancing with Memory. In Proc. 43th Symposium on Foundations of Computer Science (FOCS), pages 799-808, 2002.
33. M. Mitzenmacher, A. Richa, and R. Sitaraman. Handbook of Randomized Computing, volume 1, chapter The Power of Two Random Choices: A Survey of the Techniques and Results, pages 255-312. Kluwer Academic Publishers, Dordrecht, 2001.
34. M. Naor. A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM Journal on Discrete Mathematics, 4(3):409-412, 1991.
35. D. Peleg and V. Rubinovich. A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. In Proc. 40th Symposium on Foundations of Computer Science (FOCS), pages 253-261, 1999.
36. Y. Peres, K. Talwar, and U. Wieder. The (1 + β)-Choice Process and Weighted Balls-into-Bins. In Proc. 21th Symposium on Discrete Algorithms (SODA), pages 1613-1619, 2010.
37. R. Raman. The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. In Proc. 10th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 161-175, 1990.
38. V. Stemann. Parallel Balanced Allocations. In Proc. 8th Symposium on Parallel Algorithms and Architectures (SPAA), pages 261-269, 1996.
39. K. Talwar and U. Wieder. Balanced Allocations: The Weighted Case. In Proc. 39th Symposium on Theory of Computing (STOC), pages 256-265, 2007.
40. B. Vöcking. How Asymmetry Helps Load Balancing. Journal of the ACM, 50(4):568-589, 2003.
41. U. Wieder. Balanced Allocations with Heterogenous Bins. In Proc. 19th Symposium on Parallel Algorithms and Architectures (SPAA), pages 188-193, 2007.