A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1685 LNCS, Issue , 1999, Pages 1059-1067

  Hénon, Pascal ^a   Ramet, Pierre ^a   Roman, Jean ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; SCHEDULING;

IRREGULAR PROBLEMS;

SCHEDULING ALGORITHMS;

EID: 84878666531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_148     Document Type: Conference Paper

References (13)

1. P. Amestoy, T. Davis, and I. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. and Appl., 17:886-905, 1996.
2. C. Ashcraft. The fan-both family of column-based distributed Cholesky factorization algorithms. Graph Theory and Sparse Matrix Computation, IMA, SpringerVerlag, 56:159-190, 1993.
3. C. Ashcraft, S. C. Eisenstat, and J. W.-H. Liu. A fan-in algorithm for distributed sparse numerical factorization. SIAM J. Sci. Stat. Comput., 11(3):593-599, 1990.
4. C. Ashcraft, S. C. Eisenstat, J. W.-H. Liu, and A. Sherman. A comparison of three column based distributed sparse factorization schemes. In Proc. Fifth SIAM Conf. on Parallel Processing for Scientific Computing, 1991.
5. P. Charrier and J. Roman. Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. Numerische Mathematik, 55:463-476, 1989.
6. I. S. Duff. Sparse numerical linear algebra: direct methods and preconditioning. Technical Report TR/PA/96/22, CERFACS, 1996.
7. G. A. Geist and E. Ng. Task scheduling for parallel sparse Cholesky factorization. Internat. J. Parallel Programming, 18(4):291-314, 1989. (Pubitemid 20721699)
8. F. Pellegrini and J. Roman. Sparse matrix ordering with scotch. In Proceedings of HPCN'97, Vienna, LNCS 1225, pages 370-378, April 1997. (Pubitemid 127066580)
9. F. Pellegrini, J. Roman, and P. Amestoy. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. In Proceedings of IRREGULAR'99, Puerto Rico, LNCS 1586, pages 986-995, April 1999.
10. A. Pothen and C. Sun. A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Comput., 14(5):1253-1257, September 1993.
11. E. Rothberg. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers. SIAM J. Sci. Comput., 17(3):699-713, May 1996. (Pubitemid 126621176)
12. E. Rothberg and A. Gupta. An efficient block-oriented approach to parallel sparse Cholesky factorization. SIAM J. Sci. Comput., 15(6):1413-1439, November 1994.
13. E. Rothberg and R. Schreiber. Improved load distribution in parallel sparse Cholesky factorization. In Proceedings of Supercom puting'94, pages 783-792. IEEE, 1994.