PT-Scotch: A tool for efficient parallel graph ordering

Parallel Computing

Volumn 34, Issue 6-8, 2008, Pages 318-331

  Chevalier, C ^a   Pellegrini, F ^a  

^a INRIA   (France)

Author keywords

Distributed memory computer; Multi threading; Parallel graph ordering; Parallel nested dissection

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SOFTWARE PACKAGES;

DISTRIBUTED-MEMORY COMPUTERS; MULTI-THREADING; PARALLEL GRAPH ORDERING; PARALLEL NESTED DISSECTION;

GRAPH THEORY;

EID: 44349158351     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2007.12.001     Document Type: Article

References (31)

1. MeTiS: family of multilevel partitioning algorithms. .
2. Jostle: graph partitioning software. .
3. Scotch: static mapping, graph partitioning, and sparse matrix block ordering package. .
4. Tinney W.F., and Walker J.W. Direct solutions of sparse network equations by optimally ordered triangular factorization. J. Proc. IEEE 55 (1967) 1801-1809
5. Amestoy P., Davis T., and Duff I. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17 (1996) 886-905
6. George A., and Liu J.W.-H. The evolution of the minimum degree ordering algorithm. SIAM Rev. 31 (1989) 1-19
7. Liu J.W.-H. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11 2 (1985) 141-153
8. T.-Y. Chen, J.R. Gilbert, S. Toledo, Toward an efficient column minimum degree code for symmetric multiprocessors, in: Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, 1999.
9. George J.A., and Liu J.W.-H. Computer Solution of Large Sparse Positive Definite Systems (1981), Prentice Hall
10. Pellegrini F., Roman J., and Amestoy P. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurr.: Pract. Exp. 12 (2000) 69-84
11. Barnard S.T., and Simon H.D. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurr.: Pract. Exp. 6 2 (1994) 101-117
12. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of Supercomputing, 1995.
13. Karypis G., and Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20 1 (1998) 359-392
14. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. BELL Syst. Tech. J. (1970) 291-307
15. Fiduccia C.M., and Mattheyses R.M. A linear-time heuristic for improving network partitions. Proceedings of the 19th Design Automation Conference (1982), IEEE 175-181
16. Hendrickson B., and Rothberg E. Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput. 20 2 (1998) 468-489
17. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Tech. Rep. 95-035, University of Minnesota, June 1995.
18. G. Karypis, V. Kumar, A coarse-grain parallel formulation of multilevel k-way graph-partitioning algorithm, in: Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997.
19. G. Karypis, V. Kumar, ParMetis: Parallel Graph Partitioning and Sparse Matrix Ordering Library, University of Minnesota, August 2003.
20. G. Karypis, V. Kumar, Parallel multilevel k-way partitioning scheme for irregular graphs, Tech. Rep. 96-036, University of Minnesota, May 1996.
21. C. Chevalier, F. Pellegrini, Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework, in: Proceedings of EuroPar, Dresden, LNCS, vol. 4128, 2006, pp. 243-252.
22. B. Hendrickson, R. Leland, The chaco user's guide, Tech. Rep. SAND93-2339, Sandia National Laboratories, November 1993.
23. G. Karypis, V. Kumar, MeTiS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, University of Minnesota, fourth ed., September 1998.
24. Lipton R.J., Rose D.J., and Tarjan R.E. Generalized nested dissection. SIAM J. Numer. Anal. 16 2 (1979) 346-358
25. T. Davis, University of Florida Sparse Matrix Collection. .
26. PARASOL project (EU ESPRIT IV LTR Project No. 20160), 1996-1999.
27. Amestoy P., Duff I., and L'Excellent J.-Y. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184 (2000) 501-520 Special Issue on Domain Decomposition and Parallel Computing
28. F. Pellegrini, A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries, in: Proceedings of Euro-Par, Rennes, LNCS, vol. 4641, 2007, pp. 191-200. .
29. P. Hénon, P. Ramet, J. Roman, On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes, in: Proceedings of the Sixth International Conference on Parallel Processing and Applied Mathematics, Poznan, Poland, 2005.
30. Hénon P., and Saad Y. A parallel multistage ILU factorization based on a hierarchical graph decomposition. SIAM J. Sci. Comput. 28 (2006) 2266-2293
31. Hénon P., Ramet P., and Roman J. On finding approximate supernodes for an efficient block ILU(k) factorization. Parallel Comput. 34 (2008) 345-362