New challenges in dynamic load balancing

Applied Numerical Mathematics

Volumn 52, Issue 2-3 SPEC. ISS., 2005, Pages 133-152

  Devine, Karen D ^a   Boman, Erik G ^a   Heaphy, Robert T ^a   Hendrickson, Bruce A ^a   Teresco, James D ^b   Faik, Jamal ^c   Flaherty, Joseph E ^c   Gervasio, Luis G ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b WILLIAMS COLLEGE   (United States)

^c Rensselaer Polytechnic Institute   (United States)

Author keywords

Dynamic load balancing; Geometric partitioning; Hypergraph; Partitioning; Resource aware load balancing; Zoltan

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; FINITE ELEMENT METHOD; GRAPH THEORY; RECURSIVE FUNCTIONS;

DYNAMIC LOAD BALANCING; GEOMETRIC PARTITIONING; HYPERGRAPH; PARTITIONING; RESOURCE-AWARE LOAD BALANCING; ZOLTAN;

DYNAMIC LOADS;

EID: 10444272489     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apnum.2004.08.028     Document Type: Conference Paper

References (70)

1. M.J. Berger, S.H. Bokhari, A partitioning strategy for nonuniform problems on multiprocessors, IEEE Trans. Comput. 36 (5) (1987) 570-580.
2. M. Berzins, A new algorithm for adaptive load balancing, in: Proc. of 12th SLAM Conf. Parallel Processing for Scientific Computing, SLAM, Philadelphia, PA, 2004.
3. E. Boman, K. Devine, R. Heaphy, B. Hendrickson, M. Heroux, R. Preis, LORD report: Parallel repartitioning for optimal solver performance, Tech. Rep. SAND2004-0365, Sandia National Laboratories, Albuquerque, NM, February 2004.
4. T. Bui, C. Jones, A heuristic for reducing fill in sparse matrix factorization, in: Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, pp. 445-452.
5. A. Butz, Alternative algorithm for Hubert's space-filling curve, IEEE Trans. Comput. (1971) 424-426.
6. A. Caldwell, A. Kahng, J. Markov, Design and implementation of move-based heuristics for VLSI partitioning, ACM J. Experimental Algs. 5 (2000).
7. P.M. Campbell, The performance of an octree load balancer for parallel adaptive finite element computation, Master's thesis, Computer Science Dept., Rensselaer Polytechnic Institute, Troy, NY, 2001.
8. U. Catalyurek, C. Aykanat, Decomposing irregularly sparse matrices for parallel matrix-vector multiplications, in: Lecture Notes in Computer Science, vol. 1117, Springer, Berlin, 1996, pp. 75-86.
9. U. Catalyurek, C. Aykanat, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. Systems 10 (7) (1999) 673-693.
10. C. Chang, T. Kurc, A. Sussman, U. Catalyurek, J. Saltz, A hypergraph-based workload partitioning strategy for parallel data aggregation, in: Proc. of 11th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 2001.
11. G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, J. Parallel Distrib. Comput. 7 (1989) 279-301.
12. K. Devine, E. Boman, R. Heaphy, B. Hendrickson, C. Vaughan, Zoltan data management services for parallel dynamic applications, Comput. Sci. Engrg. 4 (2) (2002) 90-97.
13. K. Devine, J. Flaherty, Parallel adaptive hp-refinement techniques for conservation laws, Appl. Numer. Math. 20 (1996) 367-386.
14. K. Devine, B. Hendrickson, E. Boman, M.St. John, C. Vaughan, Zoltan: A dynamic load balancing library for parallel applications; User's Guide, Sandia National Laboratories, Albuquerque, NM, tech. Report SAND99-1377 http://www.cs.sandia.gov/Zoltan/ug_html/ug.html, 1999.
15. K.D. Devine, B.A. Hendrickson, Tinkertoy parallel programming: A case study with Zoltan, Internat. J. Comput. Sci. Engrg., in press.
16. J.J. Dongarra, C.B. Moler, J.R. Bunch, G.W. Stewart, LINPACK User's Guide, SIAM, Philadelphia, PA, 1979.
17. ∞ Collocation, Ph.D. Thesis, The University of Texas at Austin, May 1997.
18. T. Eliassi-Rad, A. Pothen, A. Pinar, K. Henderson, E. Chow, B. Hendrickson, Graph partitioning for complex networks, in: Proc. of 12th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 2004.
19. J. Faik, L.G. Gervasio, J.E. Flaherty, J. Chang, J.D. Teresco, E.G. Boman, K.D. Devine, A model for resource-aware load balancing on heterogeneous clusters, Tech. Rep. CS-03-03, Williams College Department of Computer Science, http://www.cs.williams.edu/drum/, 2003.
20. C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, in: Proc. 19th IEEE Design Automation Conf., IEEE, New York, 1982, pp. 175-181.
21. J. Flaherty, R. Loy, M. Shephard, B. Szymanski, J. Teresco, L. Ziantz, Adaptive local refinement with octree load-balancing for the parallel solution of three-dimensional conservation laws, J. Parallel Distrib. Comput. 47 (2) (1998) 139-152.
22. L.J.D. Frink, A.G. Salinger, M.P. Sears, J.D. Weinhold, A.L. Frischknecht, Numerical challenges in the application of density functional theory to biology and nanotechnology, J. Phys. Cond. Matter 14 (2002) 12167-12187.
23. B. Hendrickson, Graph partitioning and parallel solvers: Has the emperor no clothes?, in: Lecture Notes in Computer Science, vol. 1457, Springer, Berlin, 1998, pp. 218-225.
24. B. Hendrickson, T. Kolda, Graph partitioning models for parallel computing, Parallel Comput. 26 (2000) 1519-1534.
25. B. Hendrickson, R. Leland, The Chaco user's guide, version 2.0, Tech. Rep. SAND94-2692, Sandia National Laboratories, Albuquerque, NM, October 1994.
26. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proc. Supercomputing '95, ACM, New York, 1995.
27. Y. Hu, R. Blake, An optimal dynamic load balancing algorithm, Tech. Report DL-P-95-011, Daresbury Laboratory, Warrington, WA4 4AD, UK, December 1995.
28. Y.F. Hu, R.J. Blake, D.R. Emerson, An optimal migration algorithm for dynamic load balancing, Concurrency: Prac. Exper. 10 (1998) 467-483.
29. M.A. Iqbal, Approximate algorithms for partitioning and assignment problems, Internat. J. Parallel Programming 20 (1991) 341-361.
30. G. Karypis, Multi-constraint mesh partitioning for contact/impact computations, in: Proc. SC2003, ACM, Phoenix, AZ, 2003.
31. G. Karypis, R. Aggarwal, V. Kumar, S. Shekhar, Multilevel hypergraph partitioning: Application in VLSI domain, in: Proc. 34th Conf. Design Automation, ACM, New York, 1997, pp. 526-529.
32. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Tech. Rep. CORR 95-035, University of Minnesota, Dept. Computer Science, Minneapolis, MN, June 1995.
33. G. Karypis, V. Kumar, ParMETIS: Parallel graph partitioning and sparse matrix ordering library, Tech. Rep. 97-060, Department of Computer Science, University of Minnesota, available on the www at URL http://www.cs.umn.edu/~metis (1997).
34. G. Karypis, V. Kumar, Multilevel algorithms for multiconstraint graph paritioning, Tech. Rep. 98-019, Department of Computer Science, University of Minnesota, 1998.
35. J. Lawder, P. King, Using Space-Filling Curves for Multi-Dimensional Indexing, Lecture Notes in Computer Science, Springer, Berlin, 1832.
36. J. Lawder, P. King, Querying multi-dimensional data indexed using the Hubert space-filling curve, SIGMOD Record 30 (1) (2001) 19-24.
37. E. Leiss, H. Reddy, Distributed load balancing: Design and performance analysis, W.M. Keck Res. Comput. Laboratory 5 (1989) 205-270.
38. C.Y. Lo, J. Matousek, W. Steiger, Algorithms for ham-sandwich cut, Discrete Comput. Geometry 11 (4) (1994) 433-452.
39. B. Maerten, D. Roose, A. Basermann, J. Fingberg, G. Lonsdale, DRAMA: A library for parallel dynamic load balancing of finite element applications, in: Proc. Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, 1999.
40. T. Minyard, Y. Kallinderis, Parallel load balancing for dynamic execution environments, Comput. Methods Appl. Mech. Engrg. 189 (4) (2000) 1295-1309.
41. W.F. Mitchell, Refinement tree based partitioning for adaptive grids, in: Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1995, pp. 587-592.
42. W.F. Mitchell, The design of a parallel adaptive multi-level code in Fortran 90, in: Proc. 2002 Intematl. Conf. on Computational Science, Amsterdam, 2002.
43. D. Moore, Fast Hubert curve generation, sorting and range queries, http://www.caam.rice.edu/~dougm/twiddle/Hilbert.
44. B. Olstad, F. Manne, Efficient partitioning of sequences, IEEE Trans. Comput. 44 (1995) 1322-1326.
45. M. Ozdal, C. Aykanat, Hypergraph models and algorithms for data-pattern based clustering, Data Mining and Knowledge Discovery 9 (1) (2004) 29-57.
46. A. Patra, J.T. Oden, Problem decomposition for adaptive hp finite element methods, J. Comput. Systems Engrg. 6 (2) (1995) 97-109.
47. F. Pelligrini, SCOTCH 3.4 user's guide, Research Rep. RR-1264-01, LaBRI, November 2001.
48. J.R. Pilkington, S.B. Baden, Partitioning with spacefilling curves, CSE Technical Report CS94-349, Dept. Computer Science and Engineering, University of California, San Diego, CA, 1994.
49. A. Pinar, Combinatorial algorithms in scientific computing, Ph.D. Thesis, University of Illinois-Urbana-Champaign, 2001.
50. A. Pinar, B. Hendrickson, Communication support for adaptive computation, in: Proc. 10th SIAM Conf. Parallel Processing for Scientific Computing, Portsmouth, VA, 2001.
51. A. Pinar, B. Hendrickson, Exploiting flexibly assignable work to improve load balance, in: Proc. 14th ACM Symp. Parallel Algs and Archs, ACM, New York, 2002, pp. 155-163.
52. 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.
53. A. Pothen, H. Simon, K. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. 11 (3) (1990) 430-452.
54. R. Preis, R. Diekmann, The PARTY partitioning library, user guide version 1.1, Tech. Rep. tr-rsfb-96-024, Dept. of Computer Science, University of Paderborn, Paderborn, Germany, September 1996.
55. H. Sagan, Space-Filling Curves, Springer, New York, 1994.
56. K. Schloegel, G. Karypis, V. Kumar, Multilevel diffusion algorithms for repartitioning of adaptive meshes, J. Parallel Distrib. Comput. 47 (2) (1997) 109-124.
57. K. Schloegel, G. Karypis, V. Kumar, Parallel static and dynamic multiconstraint graph partitioning, Concurrency Comput. Practice Experience 14 (3) (2002) 219-240.
58. H.D. Simon, Partitioning of unstructured problems for parallel processing, in: Proc. Conference on Parallel Methods on Large Scale Structural Analysis and Physics Applications, Pergamon Press, New York, 1991.
59. S. Sinha, M. Parashar, Adaptive system partitioning of AMR applications on heterogeneous clusters, Cluster Comput. 5 (4) (2002) 343-352.
60. A.H. Stone, J.W. Tukey, Generalized sandwich theorems, Duke Math. J. 9 (1942) 356-359.
61. V.E. Taylor, B. Nour-Omid, A study of the factorization fill-in for a parallel implementation of the finite element method, Internat. J. Numer. Methods Engrg. 37 (1994) 3809-3823.
62. J.D. Teresco, Hierarchical partitioning and dynamic load balancing for scientific computation, Tech. Rep. CS-04-04, Williams College Department of Computer Science, PARA '04, June 20-23, 2004.
63. J.D. Teresco, M.W. Beall, J.E. Flaherty, M.S. Shephard, A hierarchical partition model for adaptive finite element computation, Comput. Methods Appl. Mech. Engrg. 184 (2000) 269-285.
64. S. Thomas, Software Library, http://www.mit.edu/afs/athena.mit.edu/activity/c/cgs/src/urt3.1/lib/hilbert.c, 1991.
65. B. Vastenhouw, R.H. Bisseling, A two-dimensional data distribution method for parallel sparse matrix-vector multiplication, SIAM Rev., in press.
66. C. Walshaw, The Parallel JOSTLE Library User's Guide, Version 3.0, University of Greenwich, London, UK, 2002.
67. C. Walshaw, M. Cross, Multilevel mesh partitioning for heterogeneous communication networks, Future Generation Comput. Syst. 17 (5) (2001) 601-623 (originally published as Univ. Greenwich Tech. Rep. 00/IM/57).
68. C. Walshaw, M. Cross, K. McManus, Multiphase mesh partitioning, App. Math. Modelling 25 (2000) 123-140.
69. M.S. Warren, J.K. Salmon, A parallel hashed oct-tree n-body algorithm, in: Proc. Supercomputing '93, Portland, OR, 1993.
70. R. Wolski, N.T. Spring, J. Hayes, The network weather service: A distributed resource performance forecasting service for metacomputing, Future Generation Comput. Syst. 15 (5-6) (1999) 757-768.