A new scheduling algorithm for parallel sparse LU factorization with static pivoting

Proceedings of the International Conference on Supercomputing

Volumn 2002-November, Issue , 2002, Pages

  Grigori, Laura ^a   Li, Xiaoye S ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; MEMORY ARCHITECTURE;

DISTRIBUTED MEMORY ARCHITECTURE; DISTRIBUTED MEMORY MACHINES; LU FACTORIZATION; MATRIX; PARALLEL EXECUTIONS; REAL-WORLD; STATIC SCHEDULING; SYMMETRICS;

SCHEDULING ALGORITHMS;

EID: 85055521808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2002.10032     Document Type: Conference Paper

References (16)

1. P. R. Amestoy, I. S. Duff, J.-Y. L'Excellent, and X. S. Li. Analysis and comparison of two general sparse solvers for distributed memory computers. ACM Transactions on Mathematical Software, 27(4):388-421, Dec. 2001.
2. J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. H. Liu. A Supernodal Approach to Sparse Partial Pivoting. SIAM Journal on Matrix Analysis and Applications, 20(3):720-755, 1999.
3. I. S. Duff and J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Analysis and Applications, 22(4):973-996, 2001.
4. S. C. Eisenstat and J. W. H. Liu. Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization. SIAM J. Matrix Anal. Appl., 13(1):202-211, 1992.
5. S. C. Eisenstat and J. W. H. Liu. Exploiting structural symmetry in a sparse partial pivoting code. SIAM Journal on Scientific Computing, 14(1):253-257, January 1993.
6. H. El-Rewini, H. H. Ali, and T. G. Lewis. Task scheduling in multiprocessing systems. IEEE Computer, pages 27-37, Dec. 1995.
7. J. A. George, J. W. H. Liu, and E. G. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10:287-298, 1989.
8. J. R. Gilbert and J. W. Liu. Elimination structures for unsymmetric sparse LU factors. SIAM J. Matrix Anal. Appl., 14(2):334-352, April 1993.
9. P. Henon, P. Ramet, and J. Roman. Pastix: A parallel direct solver for sparse spd matrices based on efficient static scheduling and memory managment. In SIAM Conference PPSC'2001, Portsmouth, Virginie, USA, 2001.
10. M. Joshi, G. Karypis, V. Kumar, A. Gupta, and F. Gustavson. PSPASES: Scalable Parallel Direct Solver Library for Sparse Symmetric Positive Definite Linear Systems. Technical report, University of Minnesota and IBM Thomas J. Watson Research Center, May 1999.
11. X. S. Li and J. W. Demmel. Making Sparse Gaussian Elimination Scalable by Static Pivoting. SuperComputing, 1998.
12. X. S. Li and J. W. Demmel. A Scalable Sparse Direct Solver Using Static Pivoting. 9th SIAM Conference on Parallel Processing and Scientific Computing, 1999.
13. J. W. Liu. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Software, 11:141-153, 1985.
14. J. W. H. Liu. The Role of Elimination Trees in Sparse Factorization. SIAM J. Matrix Annal. Appl., 11(1):134-172, 1990.
15. A. Pothen and C. Sun. A Mapping Algorithm for Parallel Sparse Cholesky Factorization. SIAM Journal on Scientific Computing, pages 1253-1257, 1993.
16. M. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Trans. on Parallel and Distributed Systems, 5(9):951-967, 1994.