Impact of reordering on the memory of a multifrontal solver

Parallel Computing

Volumn 29, Issue 9, 2003, Pages 1191-1218

  Guermouche, Abdou ^a   L'Excellent, Jean Yves ^a   Utard, Gil ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Assembly tree; Memory; Parallel multifrontal method; Reordering; Sparse direct solvers

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA; SCHEDULING;

PARALLEL MEMORY;

PARALLEL PROCESSING SYSTEMS;

EID: 0141755162     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00099-1     Document Type: Conference Paper

References (25)

1. Amestoy P.R., Davis T.A., Duff I.S. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications. 17:1996;886-905.
2. Amestoy P.R., Duff I.S. Memory management issues in sparse multifrontal methods on multiprocessors. International Journal of Supercomputer Applications. 7:1993;64-82.
3. Amestoy P.R., Duff I.S., Koster J., L'Excellent J.-Y. A fully synchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications. 23(1):2001;15-41.
4. Amestoy P.R., Duff I.S., L'Excellent J.-Y. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods in Applied Mechanics and Engineering. 184:2000;501-520.
5. Ashcraft C., Grimes R.G., Lewis J.G., Peyton B.W., Simon H.D. Progress in sparse matrix methods for large linear systems on vector computers. International Journal of Supercomputer Applications. 1(4):1987;10-30.
6. J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, R.C. Whaley, ScaLAPACK: A portable linear algebra library for distributed memory computers - design issues and performance, Technical Report LAPACK Working Note 95, CS-95-283, University of Tennessee, 1995.
7. I.S. Duff, R.G. Grimes, J.G. Lewis, The Rutherford-Boeing sparse matrix collection, Technical Report TR/PA/97/36, CERFACS, Toulouse, France, 1997. Also Technical Report RAL-TR-97-031 from Rutherford Appleton Laboratory and Technical Report ISSTECH-97-017 from Boeing Information & Support Services.
8. Duff I.S., Koster J. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM Journal on Matrix Analysis and Applications. 22(4):2001;973-996.
9. Duff I.S., Reid J.K. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software. 9:1983;302-325.
10. Duff I.S., Reid J.K. The multifrontal solution of unsymmetric sets of linear systems. SIAM Journal on Scientific and Statistical Computing. 5:1984;633-641.
11. Geist A., Ng E. Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming. 18:1989;291-314.
12. George A., Liu J.W.H. Computer Solution of Large Sparse Positive Definite Systems. 1981;Prentice-Hall, Englewood Cliffs, NJ.
13. A. Guermouche, J.-Y. L'Excellent, G. Utard, On the memory usage of a parallel multifrontal solver, Technical Report RR-4617, INRIA, 2002. Also LIP Research Report RR(2002)-42.
14. A. Guermouche, J.-Y. L'Excellent, G. Utard, Analysis and improvements of the memory usage of a multifrontal solver, Technical Report RR-4829, INRIA, 2003. Also LIP Report RR(2003)-08.
15. G. Karypis, V. Kumar, METIS - a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices - Version 4.0, University of Minnesota, September 1998.
16. Liu J.W.H. Modification of the minimum degree algorithm by multiple elimination. ACM Transactions on Mathematical Software. 11(2):1985;141-153.
17. Liu J.W.H. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software. 12:1986;127-148.
18. Liu J.W.H. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications. 11:1990;134-172.
19. Ng E., Raghavan P. Performance of greedy heuristics for sparse Cholesky factorization. SIAM Journal on Matrix Analysis and Applications. 20:1999;902-914.
20. F. Pellegrini, SCOTCH 3.4 user's guide, Technical Report RR 1264-01, LaBRI, Université Bordeaux I, November 2001.
21. Pellegrini F., Roman J., Amestoy P.R. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience. 12:2000;69-84. (Preliminary version published in Proceedings of Irregular'99 LNCS 1586, pp. 986-995).
22. Pellegrini F., Roman J., Amestoy P.R. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience. 12:2000;69-84. (Preliminary version published in Proceedings of Irregular'99 LNCS 1586, pp. 986-995).
23. Rothberg E., Schreiber R. Efficient methods for out-of-core sparse Cholesky factorization. SIAM Journal on Scientific Computing. 21(1):1999;129-144.
24. Rothberg E., Eisenstat Stanley C. Node selection strategies for bottom-up sparse matrix ordering. SIAM Journal on Matrix Analysis and Applications. 19(3):1998;682-695.
25. Schulze J. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT. 41(4):2001;800-841.