On the memory usage of a parallel multifrontal solver

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

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

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS;

DYNAMIC SCHEDULING; MEMORY SIZE; MEMORY USAGE; MULTIFRONTAL; SPARSE DIRECT SOLVER; SPARSE MATRICES; STATE OF THE ART;

FORESTRY;

EID: 12444335033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213187     Document Type: Conference Paper

References (14)

1. P. R. Amestoy, T. A. Davis, and I. S. Duff. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17:886-905, 1996.
2. P. R. Amestoy, I. S. Duff, J. Koster, and J.-Y. L'Excellent. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications, 23(1):15-41, 2001.
3. P . R. Amestoy, I. S. Duff, and J.-Y. L'Excellent. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. , 184:501-520, 2000.
4. I. S. Duff, R. G. Grimes, and J. G. Lewis. The Rutherford-Boeing Sparse Matrix Collection. Technical Report TR/PA/97/36, CERFACS, Toulouse, France, 1997.
5. I. S. Duff and J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM Journal on Matrix Analysis and Applications, 22(4):973-996, 2001.
6. I. S. Duff and J. K. Reid. The multifrontal solution of unsymmetric sets of linear systems. SIAMJournal on Scientific and Statistical Computing, 5:633-641, 1984.
7. A. Geist and E. Ng. Task scheduling for parallel sparse Cholesky factorization. Int J. Parallel Programming, 18:291-314, 1989.
8. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ. , 1981.
9. A. Guermouche, J.-Y. L'Excellent, and G. Utard. Analysis and improvments of the memory usage in a multifrontal solver. Technical Report to appear, INRIA, 2003.
10. G. Karypis and 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, Sept. 1998.
11. J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications, 11:134-172, 1990.
12. F. Pellegrini. SCOTCH 3. 4 User's guide. Technical Report RR 1264-01, LaBRI, Université Bordeaux I, Nov. 2001.
13. F. Pellegrini, J. Roman, and P. R. Amestoy. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience, 12:69-84, 2000.
14. J. Schulze. Towards a tighter coupling of bottom-up and topdown sparse matrix ordering methods. BIT, 41(4):800-841, 2001.