Analysis of nearest neighbor load balancing algorithms for random loads

Parallel Computing

Volumn 25, Issue 8, 1999, Pages 1013-1033

  Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; PROBABILITY;

DIFFUSION LOAD BALANCING; LOAD BALANCING RANDOM LOAD; MAXIMUM LOAD DEVIATION; NEAREST NEIGHBOR LOAD BALANCING ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0033353458     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00040-X     Document Type: Article

References (20)

1. Boillat J.E. Load balancing and Poisson equation in a graph. Concurrency: Practice and Experience. 2(4):1990;289-311.
2. Cybenko G. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing. 7:1989;279-301.
3. W. Feller, An Introduction to Probability Theory and its Applications, 3rd ed., Wiley, New York, 1968.
4. B. Ghosh, F.T. Leighton, B.M. Maggs, S. Muthukrishnan, C.G. Plaxton, R. Rajaraman, A.W. Richa, T.E. Tarjan, D. Zuckerman, Tight analyses of two local load balancing algorithms, in: ACM Symposium on the Theory of Computing, 1995.
5. B. Ghosh, S. Muthukrishnan, M.H. Schultz, First and second order diffusive methods for rapid coarse distributed load balancing, in: ACM Symposium on Parallel Architectures and Algorithms, 1996, pp. 72-81.
6. Graham R.L., Knuth D.E., Patashnik O. Concrete Mathematics. 1992;Addison Wesley, Reading, MA.
7. Hofri M. Probabilistic Analysis of Algorithms. 1987;Springer, Berlin.
8. Horton G. A multi-level diffusion method for dynamic load balancing. Parallel Computing. 19:1993;209-218.
9. Kohring G.A. Dynamic load balancing for parallelized particle simulations on MIMD computers. Parallel Computing. 21:1995;683-693.
10. N. Kuck, M. Middendorf, H. Schmeck. Generic branch-and-bound on a network of transputers, in: R. Grebe et al. (Eds.), Transputer Applications and Systems, IOS Press, 1993, pp. 521-535.
11. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing. Design and Analysis of Algorithms. 1994;Benjamin/Cummings, New-York.
12. Leighton F.T., Maggs B.M., Ranade A.G., Rao S.B. Randomized routing and sorting on fixed-connection networks. Journal of Algorithms. 17:1994;157-205.
13. Nakamura K. Asynchronous cellular automata and their computational ability. Systems, Computers, Controls. 5:1974;58-66.
14. Qian X., Yang Q. An analytical model for load balancing on symmetric multiprocessor systems. Journal of Parallel and Distributed Computing. 20:1994;198-211.
15. P. Sanders, On the efficiency of nearest neighbor load balancing for random loads. In Parcella 96, VII. International Workshop on Parallel Proccessing by Cellular Automata and Arrays, Akademie Verlag, Berlin, 1996, pp. 120-127.
16. P. Sanders, T. Worsch, Konvergente lokale Lastverteilungsverfahren und ihre Modellierung durch Zellularautomaten, in: PARS Workshop, number 14 in PARS Mitteilungen, 1995, pp. 285-291.
17. Song J. A partially asynchronous and iterative algorithm for distributed load balancing. Parallel Computing. 20:1994;853-868.
18. R. Subramanian, I.D. Scherson, An analysis of diffusive load-balancing, in: ACM Symposium on Parallel Architectures and Algorithms, 1994, pp. 220-225.
19. S. Tschöke, M. Räcke, R. Lüling, B. Monien, Solving the traveling salesman problem with a parallel branch-and-bound algorithm on a 1024 processor network, Technical report, Universität Paderborn, 1994.
20. Xu C., Lau F.C. The generalized dimension exchange method for load balancing in k-ary n-cubes and variants. Journal of Parallel and Distributed Computing. 24(1):1995;72-85.