Graph partitioning based methods and tools for scientific computing

Parallel Computing

Volumn 23, Issue 1-2, 1997, Pages 153-164

  Pellegrini, François ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Domain decomposition; Dual recursive bipartitioning; Graph partitioning; Static mapping

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; GRAPH THEORY; NATURAL SCIENCES COMPUTING; OPTIMIZATION; RECURSIVE FUNCTIONS;

DUAL RECURSIVE BIPARTITIONING; SOFTWARE PACKAGE SCOTCH; STATIC MAPPING;

PARALLEL PROCESSING SYSTEMS;

EID: 0031122367     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(96)00102-0     Document Type: Article

References (18)

1. S.T. Barnard and H.D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Pract. Exper. 6(2) (1994) 101-117.
2. F. Ercal, J. Ramanujam and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitioning. JPDC 10 (1990) 35-44.
3. C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions, in: Proc. 19th Design Autom. Conf (IEEE, 1982) 175-181.
4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness (W.H. Freeman, San Francisco, 1979).
5. S.W. Hammond. Mapping unstructured grid computations to massively parallel computers, Ph.D. Thesis, Rensselaer Polytechnic Institute, Feb. 1992.
6. B. Hendrickson, personal communication. Jul. 1996.
7. B. Hendrickson and R. Leland. The CHACOs user's guide: Version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, 1994.
8. B. Hendrickson and R. Leland. An empirical study of static load balancing algorithms, in: Proc. SHPCC'94. Knoxoille (IEEE, May 1994) 682-685.
9. B. Hendrickson, R. Leland and R. Van Driessche. Enhancing data locality by using terminal propagation, in: Proc. 29th Hawaii Int. Conf. on System Sciences (IEEE, Jan. 1996).
10. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, June 1995.
11. G. Karypis and V. Kumar. METIS: Unstructured graph partitioning and sparse matrix ordering system, Version 2.0, University of Minnesola, June 1995.
12. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. BELL Syst. Tech. J. Feb. (1970) 291-307.
13. D.M. Nicol. Rectilinear partitioning of irregular data parallel computations. J. Parallel Distrib. Comput. 23 (1994) 119-134.
14. F. Pellegrini. Static mapping by dual recursive bipartitioning of process and architecture graphs, in: Proc. of SHPCC'94, Knoxville (IEEE, May 1994) 486-493.
15. F. Pellegrini. SCOTCH 3.1 user's guide, Technical Report 1137-96, LaBRI, Université Bordeaux I, Aug. 1996, available at URL http://www.labri.u-bordeaux.fr/~pelegrin/papers/ scotch_user3.1.ps.gz.
16. F. Pellegrini and J. Roman. Experimental analysis of the Dual Recursive Bipartitioning algorithm for static mapping. Research Report 1138-96, LaBRI, Université Bordeaux 1, Sept. 1996, available at URL http://www.labri.u-bordeaux.fr/~pelegrin/papers/ scotch_expanalysis.ps.gz.
17. F. Pellegrini and J. Roman. SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, in: Proc. HPCN'96, Brussels, LNCS 1067, April (1996) 493-498.
18. A. Pothen, H.D. Simon and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. 11(3) (1990) 430-452.