Near-perfect load balancing by randomized rounding

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 121-130

  Friedrich, Tobias ^a   Sauerwald, Thomas ^a  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

DISTRIBUTED NETWORKS; LOAD-BALANCING; MINIMUM LOAD; RANDOMIZED ROUNDING; SQUARE ROOTS; THEORY; TIME STEP;

ALGORITHMS;

COMPUTATION THEORY;

EID: 70350671717     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536433     Document Type: Conference Paper

References (21)

1. W. Aiello, B. Awerbuch, B. M. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. In 25th Annual ACM Symposium on Theory of Computing (STOC'93), pages 632-641, 1993.
2. H. Arndt. Load balancing: Dimension exchange on product graphs. In 18th International Parallel and Distributed Processing Symposium (IPDPS'04). IEEE Computer Society, 2004.
3. J. Aspnes, M. Herlihy, and N. Shavit. Counting networks. J. ACM, 41(5):1020-1048, 1994.
4. P. Berenbrink, T. Friedetzky, and Z. Hu. A new analytical method for parallel, diffusion-type load balancing. J. Parallel Distrib. Comput., 69(1):54-61, 2009.
5. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, 52(6):2508-2530, 2006.
6. F. Cedo, A. Cortes, A. Ripoll, M. A. Senar, and E. Luque. The convergence of realistic distributed loadbalancing algorithms. Theor. Comp. Sys., 41(4):609-618, 2007.
7. J. Cooper and J. Spencer. Simulating a random walk with constant error. Comb. Probab. Comput., 15:815-822, 2006.
8. R. Elsässer, B. Monien, and S. Schamberger. Distributing unit size workload packages in heterogenous networks. J. Graph Algorithms & Applications, 10(1):51- 68, 2006.
9. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures & Algorithms, 1(4):447-460, 1990.
10. B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. Zuckerman. Tight analyses of two local load balancing algorithms. SIAM J. Comput., 29(1):29- 64, 1999.
11. B. Ghosh and S. Muthukrishnan. Dynamic load balancing by random matchings. Journal of Computer and System Sciences, 53(3):357-370, 1996.
12. M. Herlihy and S. Tirthapura. Randomized smoothing networks. J. Parallel and Distributed Computing, 66(5):626-632, 2006.
13. M. Klugerman. Small-depth counting networks and related topics. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology, September 1994.
14. M. Klugerman and C. Plaxton. Small-depth counting networks. In 24th Annual ACM Symposium on Theory of Computing (STOC'92), pages 417-428, 1992.
15. L. Lovász and P. Winkler. Mixing of random walks and other diffusions on a graph. Surveys in combinatorics, pages 119-154, 1995.
16. R. Lüling and B. Monien. A dynamic distributed load balancing algorithm with provable good performance. In 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA'93), pages 164-172, 1993.
17. M. Mavronicolas and T. Sauerwald. The impact of randomization in smoothing networks. In 27th Annual ACM Principles of Distributed Computing (PODC'08), pages 345-354, 2008.
18. S. Muthukrishnan, B. Ghosh, and M. H. Schultz. First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory Comput. Syst., 31(4):331-354, 1998.
19. Y. Rabani, A. Sinclair, and R. Wanka. Local divergence of Markov chains and the analysis of iterative load balancing schemes. In 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98), pages 694-705, 1998.
20. P. Raghavan and C. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
21. R. Subramanian and I. D. Scherson. An analysis of diffusive load-balancing. In 6th ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), pages 220-225, 1994.