Engineering diffusive load balancing algorithms using experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1253, Issue , 1997, Pages 111-122

  Diekmann, Ralf ^a   Muthukrishnan, S ^b   Nayakkankuppam, Madhu V ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b LUCENT TECHNOLOGIES   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCING; HEURISTIC ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CLOSED FORM SOLUTIONS; DISTRIBUTED LOAD BALANCING; EXPERIMENTAL RESEARCH; GLOBAL COMMUNICATION; LOAD BALANCING ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; SECOND-ORDER SCHEME; SYSTEMATIC EXPERIMENT;

ITERATIVE METHODS;

EID: 84947796534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63138-0_11     Document Type: Conference Paper

References (14)

1. R. Diekmann, U. Dralle, F. Neugebauer, and T. RSmke. PadFem: A portable parallel FEM-tool. In Proceedings of the International Conference on High- Performance Computing and Networking (HPCN-Europe, 96), volume 1067 of Lecture Notes in Computer Science, pages 580-585. Springer Verlag, 1996.
2. N. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia, 1996.
3. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 7:279-301, 1989.
4. G. Fox, R. Williams, and P. Messina. Parallel Computing Works! Morgan Kaufmann Publishers, 1994.
5. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks, in Proceedings of the 26th A CM Symposium on Theory of Computing, pages 632-641, 1993.
6. S. Muthukrishnan, B. Ghosh, and M. Shultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. In Jounal version, 1996, A preliminary version appeared in the Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures.
7. R. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, New Jersey, 1962.
8. G. H. Golub and R. Vaxga. Chebyshev semi-iterative methods, successive ovexrelaxation iterative methods and second order richardson iterative methods. Numerische Mathematik, 3:147-156, 1961.
9. L. A. Hageman and D. M. Young. Applied Iterative Methods. Academic Press, 1981.
10. 10.R. Barrett, M. Berry, T. Chaa, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, 1993. URL: http://net lib2.cs.utk.edu/linalg/html.templates/Templates,html.
11. R. Diekmann, D. Meyer, and B. Monien. Parallel decomposition of unstructured FEM-meshes. Concurrency: Practice and Experience, 1997. (to appear).
12. F. Alizadeh. Interior-point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13-51, February 1995.
13. F. Alizadeh, J.-P. A. Haeberly, M. V. Nayakkankuppam, and M. L. Overton. SDP pack User's Guide (Version 0.8 BETA). NYU Computer Science Department Technical Report #734, March 1997.
14. B. Mohar. Isoperimetric number of graphs. Journal of Combinatorial Theory (Series B), 47:274-291, 1989.