Load balancing fictions, falsehoods and fallacies

Applied Mathematical Modelling

Volumn 25, Issue 2, 2000, Pages 99-108

  Hendrickson, Bruce ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Graph partitioning; Load balancing; Parallel computer

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS;

GRAPH PARTITIONING; LOAD BALANCING THEORY;

COMPUTATIONAL GEOMETRY;

EID: 0034544702     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0307-904X(00)00042-1     Document Type: Article

References (30)

1. B. Hendrickson, R. Leland, The Chaco user's guide, version 2.0. Technical Report SAND95-2344, Sandia National Labs, Albuquerque, NM, 1995.
2. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
3. C. Walshaw, M. Cross, M. Everett, Mesh partitioning and load-balancing for distributed memory parallel systems, in: Proceedings of the Parallel and Distributed Computing for Computational Mechanics: Systems and Tools, Saxe-Coburg Publications, 1998.
4. R. Preis, R. Diekmann, The PARTY partitioning-library, user guide - version 1.1, Technical Report tr-rsfb-96-024, Department of Computer Science, University of Paderborn, Paderborn, Germany, 1996.
5. F. Pellegrini, SCOTCH 3.1 user's guide, Technical Report 1137-96, LaBRI, Université Bordeaux I, France, August 1996.
6. B. Hendrickson, Graph partitioning and parallelsolvers: Has the emperor no clothes? in: Solving Irregularly Structured Problems in Parallel, Irregular '98, Lecture Notes in Computer Science, vol. 1457, Springer, Berlin, 1998, pp. 218-225.
7. B. Hendrickson, T. Kolda, Graph partitioning models for parallel computing, Parallel Comput. 26 (12) (2000) 1519-1534.
8. G. Karypis, personal communication, 1998.
9. Ü.V. Çatalyürek, C. Aykanat, Decomposing irregularly sparse matrices for parallel matrix-vector multiplication, in: Parallel Algorithms for Irregularly Structured Problems, Irregular '96, Lecture Notes in Computer Science, vol. 1117, Springer, Berlin, 1996, pp. 75-86.
10. Çatalyürek Ü., Aykanat C. Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7):1999;673-693.
11. S.-H. Teng, Points, spheres and separators: a unified geometric approach to graph partitioning, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1991.
12. C. Aykanat, personal communication, 1998.
13. http://www.ccrl-nece.de/DRAMA.
14. T.G. Kolda, Partitioning sparse rectangular matrices for parallel processing, in: Solving Irregularly Structured Problems in Parallel, Irregular '98, Lecture Notes in Computer Science, vol. 1457, Springer, Berlin, 1998, pp. 68-79.
15. B. Hendrickson, T. Kolda, Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel processing, SIAM J. Sci. Comput. 21 (6) (2000) 2048-2072.
16. G. Karypis, V. Kumar, Multilevel algorithms for multi-constraint graph partitioning, Technical Report 98-019, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1998.
17. K. Schloegel, G. Karypis, V. Kumar, A new algorithm for multi-objective graph partitioning, in: Proceedings of the EuroPar '99, Lecture Notes in Computer Science, Springer, Berlin, 1999.
18. B. Hendrickson, K. Devine, Dynamic load balancing in computational mechanics, Comput. Meth. Appl. Mech. Engrg. 184 (2-4) (2000) 485-500.
19. N. Touheed, P. Selwood, P.K. Jimack, M. Berzins, A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver application, Parallel Comput. 26 (12) (2000) 1535-1554.
20. G. Karypis, V. Kumar, Parallel multilevel graph partitioning, Technical Report 95-036, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
21. E. Boman, K. Devine, B. Hendrickson, W. Mitchell, M. St. John, C. Vaughan, http://www.cs.sandia.gov/Zoltan.
22. S. Plimpton, S. Attaway, B. Hendrickson, J. Swegle, C. Vaughan, D. Gardner, Transient dynamics simulations: parallel algorithms for contact detection and smoothed particle hydrodynamics, J. Parallel Distrib. Comput. 50 (1998) 104-122 (previous version appeared in Proc. Supercomputing '96).
23. K. Brown, S. Attaway, S. Plimpton, B. Hendrickson, Parallel strategies for crash and impact simulations, Comput. Meth. Appl. Mech. Engrg. 184 (2-4) (2000) 375-390 (invited paper).
24. Farhat C., Roux F.X. An unconventional domain decomposition method for an efficient parallel solution of large-scale finite element systems. SIAM J. Sci. Stat. Comp. 13:1992;379-396.
25. Farhat C., Maman N., Brown G. Mesh partitioning for implicit computation via domain decomposition: impact and optimization of the subdomain aspect ratio. Int. J. Numer. Meth. Engrg. 38:1995;989-1000.
26. R. Diekmann, R. Preis, F. Schlimbach, C. Walshaw, Aspect-ratio for mesh partitioning, in: D. Pritchard, J. Reeve (Eds.), Proceedings of the Euro-Par '98, LNCS 1470, Springer, Berlin, 1998, pp. 347-351.
27. R. Diekmann, R. Preis, F. Schlimbach, C. Walshaw, Shape-optimized mesh partitioning and load balancing for adaptive FEM, Parallel Comput. 184 (2000) 269-285.
28. J.D. Teresco, M.W. Beall, J.E. Flaherty, M.S. Shephard, A hierarchical partition model for adaptive finite element computation, Technical Report, Rensselaer Polytechnic Institute, Troy, NY, 1998, Comput. Meth. Appl. Mech. Eng. 184 (2000) 269-285.
29. F. Pellegrini, Static mapping by dual recursive bipartitioning of process and architecture graphs, in: Proceedings of the Scalable High Performance Computational Conference, IEEE Press, New York, 1994, pp. 486-493.
30. B. Hendrickson, R. Leland, R. Van Driessche, Skewed graph partitioning, in: Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1997.