Memory-based scheduling for a parallel multifrontal solver

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 997-1006

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

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Memory; Multifrontal method; Scheduling; Sparse matrices

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; PROGRAM PROCESSORS; SCHEDULING;

FRONTAL MATRIX; MEMORY; MULTIFRONTAL METHODS; SPARSE MATRICES;

DATA STORAGE EQUIPMENT;

EID: 12444330959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

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 and I. S. Duff. Memory management issues in sparse multifrontal methods on multiprocessors. Int. J. of Supercomputer Applies., 7:64-82, 1993.
3. 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.
4. 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.
5. J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and 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.
6. O. Cozette, A. Guermouche, and G. Utard. Adaptative paging for a parallel multifrontal solver. Technical report, LIP/INRIA, 2004. In preparation.
7. 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. Also Technical Report RAL-TR-97-031 from Rutherford Appleton Laboratory and Technical Report ISSTECH-97-017 from Boeing Information & Support Services.
8. 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. Also Technical Report RAL-TR-97-031 from Rutherford Appleton Laboratory and Technical Report ISSTECH-97-017 from Boeing Information & Support Services.
9. I. S. Duff and J. K. Reid. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software, 9:302-325, 1983.
10. I. S. Duff and J. K. Reid. The multifrontal solution of unsymmetric sets of linear systems. SIAM Journal on Scientific and Statistical Computing, 5:633-641, 1984.
11. A. Geist and E. Ng. Task scheduling for parallel sparse Cholesky factorization. Int J. Parallel Programming, 18:291-314, 1989.
12. A. Guermouche. Impact de l'ordonnancement sur l'occupation mémoire d'un solveur multifrontal parallèle. In 15ieme Rencontres Francophones en Parallélisme, La Colle sur Loup, France, pages 37-45, 2003.
13. A. Guermouche, J.-Y. L'Excellent, and G. Utard. Impact of reordering on the memory of a multifrontal solver. Parallel Computing, 29(9):1191-1218, 2003.
14. A. Guermouche, J.-Y. L'Excellent, and G. Utard. On the memory usage of a parallel multifrontal solver. In Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.
15. 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.
16. J. W. H. Liu. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12:127-148, 1986.
17. E. Rothberg and R. Schreiber. Efficient methods for out-of-core sparse cholesky factorization. SIAM Journal on Scientific Computing, 21(1):129-144, 1999.
18. J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT, 41(4):800-841, 2001.