Quasirandom load balancing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1620-1629

  Friedrich, Tobias ^a   Gairing, Martin ^b   Sauerwald, Thomas ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM ERRORS;

DETERMINISTIC ALGORITHMS; FIRST-PASSAGE; NETWORK TOPOLOGY; QUASI-RANDOM; RANDOM ALGORITHMS; RANDOM WALK; RANDOMIZED ROUNDING; ROUNDING ERRORS;

PROBABILITY DISTRIBUTIONS;

EID: 77951681635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.132     Document Type: Conference Paper

References (27)

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), pp. 632-641, 1993.
2. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23:601-631, 1997.
3. J. Cooper and J. Spencer. Simulating a random walk with constant error. Combinatorics, Probability & Computing, 15:815-822, 2006.
4. G. Cybenko. Load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 7:279-301, 1989.
5. P. Diaconis, R. Graham, and J. Morrison. Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Structures and Algorithms, 1:51-72, 1990.
6. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In 19th Annual ACM-SIAM Symposium, on Discrete Algorithms (SODA '08), pp. 773-781, 2008.
7. R. Elsässer, B. Monien, and S. Schamberger. Distributing unit size workload packages in heterogenous networks. Journal of Graph Algorithms & Applications, 10:51-68, 2006.
8. T. Friedrich and T. Sauerwald. Near-perfect load balancing by randomized rounding. In 41st Annual ACM Symposium on Theory of Computing (STOC'09), pp. 121-130, 2009.
9. J. Gehrke, C. Plaxton, and R. Rajaraman. Rapid convergence of a local load balancing algorithm for asynchronous rings. Theoretical Computer Science, 220:247-265, 1999.
10. B. Ghosh and S. Muthukrishnan. Dynamic load balancing by random matchings. Journal of Computer and System Sciences, 53:357-370, 1996. (Pubitemid 126653474)
11. 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 Journal on Computing, 29:29-64, 1999.
12. G. Grimmet and D. Stirzaker. Probability and Random Processes. Oxford University Press, 3rd edition, 2001.
13. G. Jan and Y. Hwang. An efficient algorithm for perfect load balancing on hypercube multiprocessors. The Journal of Supercomputing, 25:5-15, 2003.
14. S. Karlin, B. Lindqvist, and Y.-C. Yao. Markov chains on hypercubes: Spectral representations and several majorization relations. Random Structures & Algorithms, 4:1-36, 1993.
15. J. Keilson. Markov Chain Models - Rarity and Exponentiality. Springer Verlag, 1979.
16. G. Lawler. Intersections of random walks. Probability and its Applications. Birkhäuser, 1991.
17. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdocombining double acute accent is Eighty, 2:1-46, 1993.
18. L. Lovász and P. Winkler. Mixing of random walks and other diffusions on a graph. Surveys in combinatorics, pp. 119-154, 1995.
19. B. Morris and A. Sinclair. Random walks on truncated cubes and sampling 0-1 knapsack solutions. SIAM Journal on Computing, 34:195-226, 2004.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 7th edition, 1995.
21. S. Muthukrishnan, B. Ghosh, and M. H. Schultz. First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory of Computing Systems, 31:331-354, 1998. (Pubitemid 128117003)
22. C. Plaxton. Load balancing, selection sorting on the hypercube. In 1st ACM Symposium on Parallel Algorithms and Architectures (SPAA '89), pp. 64-73, 1989.
23. 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), pp. 694-705, 1998.
24. R. Subramanian and I. D. Scherson. An analysis of diffusive load-balancing. In 6th ACM Symposium on Parallel Algorithms and Architectures (SPAA '94), pp. 220-225, New York, NY, USA, 1994. ACM.
25. S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica. Load balancing in dynamic structured peer-to-peer systems. Performance Evaluation, 63:217-240, 2006. (Pubitemid 41705254)
26. R. D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience, 3:457-481, 1991.
27. D. Zhanga, C. Jianga, and S. Li. A fast adaptive load balancing method for parallel particle-based simulations. Simulation Modelling Practice and Theory, 17:1032-1042, 2009.