Constructing memory-minimizing schedules for multifrontal methods

ACM Transactions on Mathematical Software

Volumn 32, Issue 1, 2006, Pages 17-32

  Guermouche, Abdou ^a,c   L'Excellent, Jean Yves ^b,d  

^a INRIA   (France)

^b UNIV LYON   (France)

^c IRIT   (France)

^d UNIVERSITÉ DE LYON   (France)

Author keywords

Liu's algorithm; Memory; Multifrontal methods; Scheduling; Sparse matrices

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; RESOURCE ALLOCATION;

MEMORY-ALLOCATION SCHEDULES; MULTIFRONTAL METHODS; REAL-WORLD MATRICES;

SCHEDULING;

EID: 33745263729     PISSN: 00983500     EISSN: 00983500     Source Type: Journal    
DOI: 10.1145/1132973.1132975     Document Type: Article

References (20)

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., KOSTER, J., AND L'EXCELLENT, J.-Y. 2001. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23, 1, 15-41.
4. AMESTOY, P. R., DUFF, I. S., AND L'EXCELLENT, J.-Y. 2000. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184, 501-520.
5. AMESTOY, P. R. AND PUGLISI, C. 2002. An unsymmetrized multifrontal LU factorization. SIAM J. Matrix Anal. Appl. 24, 553-569.
6. ASHCRAFT, C., GRIMES, R. G., LEWIS, J. G., PEYTON, B. W., AND SIMON, H. D. 1987. Progress in sparse matrix methods for large linear systems on vector computers. Int. J. Supercomput. Appl. 1(4), 10-30.
7. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1997. The Rutherford-Boeing sparse matrix collection. Tech. Rep. TR/PA/97/36, CERFACS, Toulouse, France. Also Tech. Rep. RAL-TR-97-031, Rutherford Appleton Laboratory and Tech. Rep. ISSTECH-97-017, Boeing Information and Support Services.
8. 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.
9. DUFF, I. S. AND REID, J. K. 1982. MA27 - A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Tech. Rep. R. 10533, AERE, Harwell, England.
10. DUFF, I. S. AND REID, J. K. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325.
11. DUFF, I. S. AND REID, J. K. 1984. The multifrontal solution of unsymmetric sets of linear systems. SIAM J. Sci. Stat. Comput. 5, 633-641.
12. GUERMOUCHE, A. AND L'EXCELLENT, J.-Y. 2004. Optimal memory minimization algorithms for the multifrontal method. Res. Rep. RR2004-26, LIP. Also INRIA Rep. RR-5179.
13. GUERMOUCHE, A., L'EXCELLENT, J.-Y., AND UTARD, G. 2003a. Analysis and improvements of the memory usage of a multifrontal solver. Res. Rep. RR-2003-08, LIP. Also INRIA Rep. RR-4829.
14. GUERMOUCHE, A., L'EXCELLENT, J.-Y., AND UTARD, G. 2003b. Impact of reordering on the memory of a multifrontal solver. Parallel Comput. 29, 9, 1191-1218.
15. 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.
16. LENGAUER, T. AND TARJAN, R. E. 1980. The space complexity of pebble games on trees. Inf. Process. Lett. 10, 4/5, 184-188.
17. LIU, J. W. H. 1986. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. 12, 127-148.
18. LIU, J. W. H. 1987. An application of generalized tree pebbling to sparse matrix factorization. SIAM J. Algebraic Discrete Meth. 8, 375-395.
19. LIU, J. W. H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 134-172.
20. SCHULZE, J. 2001. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT 41, 4, 800-841.