Two-dimensional block partitionings for the parallel sparse Cholesky factorization

Numerical Algorithms

Volumn 16, Issue 1, 1997, Pages 17-38

  Dumitrescu, B ^a   Doreille, M ^b   Roch, J L ^b   Trystram, D ^b  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

^b LMC CNRS   (France)

Author keywords

2D block partitioning; Fan in communication; Parallel algorithms; Proportional mapping; Sparse cholesky factorization

Indexed keywords

EID: 0041731470     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019122726788     Document Type: Article

References (23)

1. P.R. Amestoy, T.A. Davis and I.S. Duff, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl. 17(4) (1996) 886-905.
2. C. Ashcraft, S.C. Eisenstat and J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Statist. Comput. 11(3) (1990) 593-599.
3. C. Ashcraft and R. Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software 15(4) (1989) 291-309.
4. C. Ashcraft, R. Grimes, J. Lewis, B. Peyton and H. Simon, Progress in sparse matrix methods for large linear systems on vector supercomputers, Internat. J. Supercomput. Appl. 1 (1987) 10-29.
5. G. Cavalheiro and M. Doreille, ATHAPASCAN: A C++ library for parallel programming, in: Stratagem '96, INRIA, Sophia Antipolis, France (July 1996) p. 75.
6. J.J. Dongarra, J. Du Croz, S. Hammarling and I. Duff, A set of level-3 basic linear algebra subprograms, ACM Trans. Math. Software 16 (1990) 1-17, 18-28.
7. I.S. Duff, Sparse numerical linear algebra: direct methods and preconditioning, Technical Report TR/PA/96/22, CERFACS (1996).
8. L. Facq and J. Roman, Distribution par bloc pour une factorisation parallèle de Cholesky, in: Parallèlisme et Applications Irrégulières, eds. G. Authié et al. (Hermès, 1995) pp. 135-147.
9. G.A. Geist and E. Ng, Task scheduling for parallel sparse Cholesky factorization, Internat. J. Parallel Programming 18 (1989) 291-314.
10. A. George, M.T. Heath, J. Liu and E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Statist. Comput. 9(2) (1988) 327-340.
11. A. Gupta, G. Karypis and V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization, Technical Report 94-63, Department of Computer Science, University of Minnesota, Minneapolis (1994).
12. M.T. Heath, E. Ng and B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Rev. 33(3) (1991) 420-460.
13. L. Hulbert and E. Zmijewski, Limiting communication in parallel sparse Cholesky factorization, SIAM J. Sci. Statist. Comput. 12(5) (1991) 1184-1197.
14. G. Karypis and V. Kumar, METIS - Unstructured graph partitioning and sparse matrix ordering system, version 2.0, Technical Report, Department of Computer Science, University of Minnesota, Minneapolis (1995).
15. J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl. 11(1) (1990) 134-172.
16. E. Ng and B.W. Peyton, A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, SIAM J. Sci. Comput. 14(4) (1993) 761-769.
17. A. Pothen and C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 14(5) (1993) 1253-1257.
18. E. Rothberg, Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization, Ph.D. thesis, Stanford University (January 1993).
19. 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) (1996) 699-713.
20. E. Rothberg and A. Gupta, An efficient block-oriented approach to parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 15(6) (1994) 1413-1439.
21. E. Rothberg and R. Schreiber, Improved load distribution in parallel sparse Cholesky factorization, in: Supercomputing '94 (1994) pp. 783-792.
22. R. Schreiber, Scalability of sparse direct solvers, in: Graph Theory and Sparse Matrix Compution, The IMA Volumes in Mathematics and its Applications, Vol. 56, eds. A. George, J.R. Gilbert and J.W.H. Liu (1993) pp. 191-209.
23. M. Snir, S.W. Otto, S. Hess-Lederman, D. Walker and J.J. Dongarra, MPi: The Complete Reference (MIT Press, Cambridge, MA, 1996). Available electronically: http://www.netlib.org/utk/papers/mpi-book.html.