Analysis and comparison of two general sparse solvers for distributed memory computers

ACM Transactions on Mathematical Software

Volumn 27, Issue 4, 2001, Pages 388-421

  Amestoy, Patrick R ^a   Duff, Iain S ^b   L'Excellent, Jean Yves ^c   Li, Xiaoye S ^d  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b CERFACS   (France)

^c UNIV LYON   (France)

^d LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Algorithms; G.1.3 Numerical Analysis : Numerical linear algebra sparse, structured, and very large systems (direct and iterative methods); G.4 Mathematics of Computing : Mathematical software Parallel and vector implementations; Performance

Indexed keywords

EID: 0013092252     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/504210.504212     Document Type: Article

References (32)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886-905.
2. AMESTOY, P. R. AND DUFF, I. S. 1993. Memory management issues in sparse multifrontal methods on multiprocessors. Int. J. Supercomput. Appl. 7, 64-82.
3. AMESTOY, P. R., DUFF, I. S., AND L'EXCELLENT, J.-Y. 2000. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng., 501-520.
4. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J.-Y., AND KOSTER, J. 2001. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23, 1, 15-41.
5. AMESTOY, P. R., DUFF, I. S., AND PUGLISI, C. 1996. Multifrontal QR factorization in a multiprocessor environment. Int. J. Num. Lin. Alg. Appl. 3(4), 275-300.
6. AMESTOY, P. R., AND PUGLISI, C. 2000. An unsymmetrized multifrontal LU factorization. Tech. Rep. RT/APO/00/3, ENSEEIHT-IRIT. Also Lawrence Berkeley National Laboratory report LBNL-16474.
7. ARIOLI, M., DEMMRL, J., AND DUFF, I. S. 1989. Solving sparse linear systems with sparse backward error. SIAM J. Matrix Anal. Appl. 10, 165-190.
8. ASHCRAFT, C. AND GRIMES, R. G. 1999. SPOOLES: An object oriented sparse matrix library. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing. San Antonio, Texas, http://www.netlib.org/linalg/spooles.
9. BENZI, M., HAWS, J. C., AND TUMA, M. 2000. Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput. 22, 1333-1353.
10. BORCHARDT, J., GRUND, F., AND HORN, D. 1997. Parallel numerical methods for large systems of differential-algebraic equations in industrial applications. Tech. Rep. 382, Weierstraß-Institut für Angewandte Analysis und Stochastik, Berlin.
11. DEMMEL, J. W., EISENSTAT, S. C., GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755.
12. DEMMEL, J. W., GILBERT, J. R., AND LI, X. S. 1999. An asynchronous parallel supernodal algorithm for sparse Gaussian elimination. SIAM J. Matrix Anal. Appl. 20, 4, 915-952.
13. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1997. The Rutherford-Boeing Sparse Matrix Collection. Tech. Rep. RAL-TR-97-031, Rutherford Appleton Laboratory.
14. DUFF, I. S. AND KOSTER, J. 1999. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20, 4, 889-901.
15. DUFF, I. S. AND KOSTER, J. 2001. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22, 4, 973-996.
16. FU, C., JIAO, X., AND YANG, T. 1998. Efficient sparse LU factorization with partial pivoting on distributed memory architectures. IEEE Trans. Para. Distr. Syst. 9, 2, 109-125.
17. GILBERT, J. R. AND LIU, J. W. 1993. Elimination structures for unsymmetric sparse LU factors. SIAM J. Matrix Anal. Appl. 14, 334-352.
18. GUPTA, A. 2000. WSMP: Watson Sparse Matrix Package. Tech. rep., IBM research division, T. J. Watson Research Center, Yorktown Heights. http://www.cs.umn.edu/∼agupta/wsmp.html.
19. GUPTA, A., KARYPIS, G., AND KUMAR, V. 1997. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Para. Dist. Syst. 8, 502-520.
20. HEATH, M. T., NG, E., AND PEYTON, B. W. 1991. Parallel algorithms for sparse linear systems. SIAM Rev. 33, 420-460.
21. HEATH, M. T. AND RAGHAVAN, P. 1997. Performance of a fully parallel sparse solver. Int. J. Supercomput. Appl. 11, 1, 49-64.
22. HENON, P., RAMET, P., AND ROMAN, J. 1999. A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization. In EuroPar'99 Parallel Processing. Lecture Notes in Computer Science, No. 1685. Springer-Verlag, Berlin, Heidelberg, New York, 1059-1067.
23. HSL. 2000. A collection of Fortran codes for large scale scientific computation. http://www. cse.clrc.ac.uk/Activity/HSL.
24. KARYPIS, G. AND KUMAR, V. 1998. METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices - Version 4.0. University of Minnesota.
25. LI, X. S. AND DEMMEL, J. W. 1998. Making sparse Gaussian elimination scalable by static pivoting. In Proceedings of SC98. Orlando, Florida. http://www.supercomp.org/sc98/.
26. LI, X. S. AND DEMMEL, J. W. 1999. A scalable sparse direct solver using static pivoting. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing. San Antonio, Texas. http://www.siam.org/meetings/pp99/.
27. LI, X. S., DEMMEL, J. W., BAILEY, D. H., HENRY, G., HIDA, Y., ISKANDAR, J., KAHAN, W., KAPUR, A., MARTIN, M. C., TUNG, T., AND YOO, D. J. 2000. Design, Implementation and Testing of Extended and Mixed Precision BLAS. Tech. Rep. LBNL-45991, Lawrence Berkeley National Laboratory, Berkeley. June. (also LAPACK Working Note #149). Submitted to ACM Trans. Math. Soft.
28. LIU, J. W. H. 1985. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Soft. 11, 2, 141-153.
29. NAGEL, W. E., ARNOLD, A., WEBER, M., HOPPE, H.-C., AND SOLCHENRACH, K. 1996. VAMPIR: Visualization and Analysis of MPI resources. Supercomput. 12, 1 (Jan.), 69-80.
30. NG, E. G. AND PEYTON, B. W. 1993 A supernodal Cholesky factorization algorithm for shared-memory multiprocessors. SIAM J. Sci. Stat. Comput. 14, 761-769.
31. ROTHBEEG, E. 1994 Efficient sparse Cholesky factorization on distributed-memory multiprocessors. In Proceedings Fifth SIAM Conference on Applied Linear Algebra, J. Lewis Ed. SIAM Press, Philadelphia, 141.
32. SCHENK, O., GÄRTNER, K., AND FICHTNER, W. 2000 Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors. BIT 40, 1, 158-176.