Adapting a parallel sparse direct solver to architectures with clusters of SMPs

Parallel Computing

Volumn 29, Issue 11-12 SPEC.ISS., 2003, Pages 1645-1668

  Amestoy, Patrick R ^a   Duff, Iain S ^b   Pralet, Stéphane ^c   Vömel, Christof ^c  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b RAL   (United Kingdom)

^c CERFACS   (France)

Author keywords

Distributed memory algorithms; Dynamic scheduling; MUMPS; Sparse linear systems; Task scheduling

Indexed keywords

ALGORITHMS; GRAPH THEORY; LINEAR SYSTEMS;

TASK SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

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

References (29)

1. The OpenMP application program interface. Available from 〈 http://www.openmp.org. 〉.
2. PARASOL test data. Available from 〈 http://www.parallab.uib.no/parasol/data.html 〉, 2002.
3. Amestoy P.R., Davis T.A., Duff I.S. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17:1996;886-905.
4. Amestoy P.R., Duff I.S., L'Excellent J.Y. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comp. Meth. Appl. Mech. Eng. 2000;501-520.
5. Amestoy P.R., Duff I.S., L'Excellent J.Y., Koster J. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23(1):2001;15-41.
6. Amestoy P.R., Duff I.S., L'Excellent J.Y., Li X.S. Analysis tuning and comparison of two general sparse solvers for distributed memory computers. ACM Trans. Math. Software. 27(4):2001;388-421.
7. P.R. Amestoy, I.S. Duff, C. Vömel, Task scheduling in an asynchronous distributed memory multifrontal solver, Technical Report TR/PA/02/105, CERFACS, Toulouse, France, 2002, SIAM Journal of Matrix Analysis and Applications, submitted for publication.
8. Choi J., Demmel J., Dhillon I., Dongarra J., Ostrouchov S., Petitet A., Stanley K., Walker D., Whaley R.C. ScaLAPACK: a portable linear algebra library for distributed memory computers - design issues and performance. Comp. Phys. Commun. 97:1996;1-15. (also as LAPACK Working Note #95).
9. T.A. Davis, University of Florida sparse matrix collection, 2002. Available from 〈 http://www.cise.ufl.edu/research/sparse/matrices/ 〉.
10. Demmel J.W., Eisenstat S.C., Gilbert J.R., Li X.S., Liu J.W.H. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20(3):1999;720-755.
11. Dongarra J.J., Du Croz J., Duff I.S., Hammarling S. Algorithm 679: a set of Level 3 Basic Linear Algebra Subprograms: Model implementation and test programs. ACM Trans. Math. Software. 16(1):1990;18-28.
12. Dongarra J.J., Croz J.D., Duff I.S., Hammarling S. Algorithm 679. A set of Level 3 Basic Linear Algebra Subprograms: model implementation and test programs. ACM Trans. Math. Software. 16:1990;18-28.
13. Dongarra J.J., Duff I.S., Sorensen D.C., van der Vorst H.A. Numerical Linear Algebra for High-Performance Computers. 1998;SIAM Press, Philadelphia.
14. Duff I.S., Erisman A.M., Reid J.K. Direct Methods for Sparse Matrices. 1986;Oxford University Press, London.
15. I.S. Duff, R.G. Grimes, J.G. Lewis, The Rutherford-Boeing Sparse Matrix Collection, Technical Report RAL-TR-97-031, Atlas Centre, Rutherford Appleton Laboratory, 1997, Also Technical Report ISSTECH-97-017 from Boeing Information & Support Services and Report TR/PA/97/36 from CERFACS, Toulouse.
16. Duff I.S., Reid J.K. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Software. 9:1983;302-325.
17. Duff I.S., Reid J.K. The multifrontal solution of unsymmetric sets of linear systems. SIAM J. Sci. Stat. Comput. 5:1984;633-641.
18. George A., Liu J.W.H. An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal. 15:1978;1053-1069.
19. A. Gupta, F. Gustavson, M. Joshi, G. Karypis, V. Kumar, Pspases: An efficient and scalable parallel sparse direct solver, 1999.
20. Hénon P., Ramet P., Roman J. PaStiX: a high-performance parallel direct solver for sparse symmetric definite systems. Parallel Comput. 28(2):2002;301-321.
21. Liu J.W.H. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11:1990;134-172.
22. Liu J.W.H. The multifrontal method for sparse matrix solution: theory and practice. SIAM Rev. 34:1992;82-109.
23. Liu J.W.H., Ng E.G., Peyton W. On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. Appl. 14:1993;242-252.
24. Ng E., Raghavan P. Performance of greedy heuristics for sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20:1999;902-914.
25. F. Pellegrini, J. Roman, Sparse matrix ordering with Scotch, in: Proceedings of HPCN'97, Vienna, LNCS 1225, pp. 370-378, April 1997.
26. Pellegrini F., Roman J., Amestoy P. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurr.: Pract. Exper. 12(2-3):2000;69-84.
27. Pothen A., Sun C. A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Comput. 14(5):1993;1253-1257.
28. Rothberg E., Eisenstat S.C. Node selection strategies for bottom-up sparse matrix ordering. SIAM J. Matrix Anal. Appl. 19(3):1998;682-695.
29. Schreiber R. Scalability of sparse direct solvers. Liu J.W.H., Georges A., Gilbert J.R. Graph Theory and Sparse Matrix Computation. 1994;191-209 Springer-Verlag.