S-HARP: A scalable parallel dynamic partitioner for adaptive mesh-based computations

Proceedings of the International Conference on Supercomputing

Volumn 1998-November, Issue , 1998, Pages

  Sohn, Andrew ^a   Simon, Horst ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Adaptive meshes; Computational science; Dynamic load balancing; Graph partitioning; Mesh partitioning; Parallel partitioning

Indexed keywords

MESH GENERATION; PARALLEL PROCESSING SYSTEMS;

ADAPTIVE MESHES; COMPUTATIONAL MESH; COMPUTATIONAL SCIENCE; COMPUTATIONAL SCIENCE PROBLEMS; DYNAMIC LOAD BALANCING; GRAPH PARTITIONING; MESH PARTITIONING; MESH-BASED COMPUTATIONS; PARALLEL DYNAMICS; PARALLEL PARTITIONING;

MESSAGE PASSING;

EID: 84943564165     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1998.10023     Document Type: Conference Paper

References (16)

1. S.T. Barnard and H.D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience 6, 1994, pp. 101-117.
2. T. Chan, J. Gilbert, and S. Teng. Geometric spectral partitioning. Xerox PARC Technical Report, January 1995.
3. S. Guattery and G. L. Miller, On the performance of the spectral graph partitioning methods, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp.233-242.
4. K. Hall, An r-dimensional quadratic placement algorithm, Management Science 17, November 1970, pp.219-229.
5. B. Hendrickson and R. Leland, A Multilevel Algorithm for Partitioning Graphs, in Proceedings of Supercomputing '95, San Diego, California.
6. G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Tech. Report 95-035, University of Minnesota, 1995.
7. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, The Bell System Technical Journal, Vol. 49, 1970, pp. 291-308.
8. B. Nour-Omid, A. Raefsky and G. Lyzenga, Solving Finite Element Equations on Concurrent Computers, in Parallel Computations and their Impact on Mechanics, Ed. A.K.Noor, ASME, New York, 1986, p.209.
9. L. Oliker, Personal communication on the results of ParaMeTiS1.0 and Jostle on SP2 and T3E, July 30, 1997.
10. K. Schloegel, G. Karypis, and V. Kumar, Parallel Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes, Technical Report, University of Minnesota, 1997.
11. H. D. Simon, Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering 2, 1991, pp. 135-148.
12. H. D. Simon, A. Sohn, and R. Biswas, HARP: A fast spectral partitioner, Journal of Parallel and Distributed Computing 50, April 1998, pp.88-103
13. A. Sohn and H. D. Simon, JOVE: A dynamic load balancing framework for adaptive computations on distributed-memory multiprocessors, Technical Report, NJIT CIS 94-60, September 1994.
14. A. Sohn and R. Biswas, Special Issue on Dynamic Load Balancing, Journal of Parallel and Distributed Computing 47, December 1997, pp.99-101.
15. A. Sohn and Y. Kodama, Load Balanced Parallel Radix Sort, in Proceedings of the 12th ACM International Conference on Supercomputing, Melbourne, Australia, July 1998, pp.305-312.
16. C. Walshaw, M. Cross, and M. Everett. Dynamic mesh partitioning: a unified optimization and load-balancing algorithm. Tech. Rep. 95/IM/06, University of Greenwich, London SE18 6PF, UK, 1995.