Diffusion schemes for load balancing on heterogeneous networks

Theory of Computing Systems

Volumn 35, Issue 3, 2002, Pages 305-320

  Elsässer, Robert ^a   Monien, Burkhard ^a   Preis, Robert ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HETEROGENEOUS NETWORKS;

ALGORITHMS; COMPUTATION THEORY; COMPUTER NETWORKS; COMPUTER SIMULATION; FINITE ELEMENT METHOD; PROBLEM SOLVING;

PARALLEL PROCESSING SYSTEMS;

EID: 0036590722     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-002-1056-4     Document Type: Conference Paper

References (21)

1. [Bo] J. E. Boillat. Load balancing and Poisson equation in a graph. Concurrency: Practice & Experience, 2:289-313, 1990.
2. [Ch] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian. In G. Gunning, editor. Problems in Analysis, pages 195-199. Princeton University Press, Princeton, NJ, 1970.
3. [Cy] G. Cybenko. Load galancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 7:279-301, 1989.
4. [DFM] R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
5. J. Dodziuk and W. S. Kendall. Combinatorial Laplacians and Isoperimetric Inequality, pages 68-74. Research Notes in Mathematics. Pitman, Boston, MA, 1986.
6. [DMN] R. Diekmann, S. Muthukrishnan, and M. V. Nayakkankuppam. Engineering diffusive load balancing algorithms using experiments. In G. Bilardi et al., editors, IRREGULAR '97, pages 111-122. LNCS 1253. Springer-Verlag, Berlin, 1997.
7. [DMP] T. Decker, B. Monien, and R. Preis. Towards optimal load balancing topologies. In Euro-Par 2000 Parallel Processing, pages 277-287. LNCS 1900. Springer-Verlag, Berlin, 2000.
8. [DS] P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1:36-61, 1991.
9. [EFMP] R. Elsässer, A. Frommer, B. Monien, and R. Preis. Optimal and alternating-direction loadbalancing schemes. In P. Amestoy et al., editors, EuroPar '99, pages 280-290. LNCS 1685. Springer-Verlag, Berlin, 1999.
10. [FWM] G. Fox, R. Williams, and P. Messina. Parallel Computing Works! Morgan Kaufmann, San Mateo, CA, 1994.
11. [GMS] B. Ghosh, S. Muthukrishnan, and M. H. Schultz. First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory of Computing Systems, 31(4):331-354, 1998.
12. [GV] G. Golub and R. Varga. Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. Numerische Mathematik, 3:147-168, 1961.
13. [HB] Y. F. Hu and R. J. Blake. An improved diffusion algorithm for dynamic load balancing. Parallel Computing, 25(4):417-444, 1999.
14. [HBE] Y. F. Hu, R. J. Blake, and D. R. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Practice & Experience, 10(6):467-483, 1998.
15. [Mo] B. Mohar. Isoperimetric numbers of graphs. Journal of Combinatorial Theory, 47(3):274-291, 1989.
16. [Re] L. Reichel. The application of Leja points to Richardson iteration and polynomial preconditioning. Linear Algebra and its Applications, 154-156:389-414, 1991.
17. [SG] V. S. Sunderarm and G. A. Geist. Heterogeneous parallel and distributed computing. Parallel Computing, 25:1699-1721, 1999.
18. [Si] A. Sinclair. Algorithms for Random Generation and Counting. Birkhäuser, Basel. 1993.
19. [SJ] A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computing, 82:93-133, 1989.
20. [Va] R. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1962.
21. [XL] C. Xu and F. C. M. Lau. Load Balancing in Parallel Computers. Kluwer, Dordrecht, 1997.