Multi-pass mapping schemes for parallel sparse matrix computations

Lecture Notes in Computer Science

Volumn 3514, Issue I, 2005, Pages 245-255

  Malkowski, Konrad ^a   Raghavan, Padma ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR SYSTEMS; MAPPING; MATRIX ALGEBRA; TREES (MATHEMATICS); FACTORIZATION; FORESTRY; MULTIPROCESSING SYSTEMS;

KRYLOV SUBSPACE ITERATIVE METHODS; MULTI-PASS MAPPING SCHEME; PARALLEL MATRIX COMPUTATIONS; TREE-STRUCTURED APPLICATIONS; LARGE SPARSE LINEAR SYSTEMS; PARALLEL COMPUTATION; SPARSE MATRIX COMPUTATIONS; SPARSE MATRIX FACTORIZATION; TASK PARALLELISM;

MULTIPROCESSING SYSTEMS; MATRIX ALGEBRA;

EID: 25144445313     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428831_31     Document Type: Conference Paper

References (20)

1. J. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. H. Liu. A supernodal approach to sparse partial pivoting. Technical Report CSL-94-14, Xerox Palo Alto Research Center, 1995.
2. I.S. Duff. Parallel implementation of multifrontal schemes. Parallel Computing, 3:193-204, 1986.
3. A. George and J. W. H. Liu. An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal., 15:1053-1069, 1978.
4. J. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs, NJ, 1981.
5. L. Grigori and X. S. Li. A new scheduling algorithm for parallel sparse LU factorization with static pivoting. In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, pages 1-18. IEEE Computer Society Press, 2002.
6. A. Gupta, F. Gustavson, M. Joshi, G. Karypis, and V. Kumar. PSPASES: An efficient and scalable parallel sparse direct solver, 1999. See http://www-users.cs.umn.edu/$\sim$mjoshi/pspases.
7. A. Gupta, V. Kumar, and A. Sameh. Performance and scalability of preconditioned conjugate gradient methods on the CM-5. In R. F Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, editors, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, pages 664-674, Philadephia, PA, 1993. SIAM Publications.
8. M. T. Heath, E. Ng, and B. W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33:420-460, 1991.
9. M. T. Heath and P. Raghavan. Performance of a fully parallel sparse solver. Int. J. Supercomputing Appl., 11:49-64, 1997.
10. M. T. Jones and P. E. Plassman. An improved incomplete Cholesky factorization. ACM Trans. Math. Software, 21:5-17, 1995.
11. G. Karypis and V. Kumar. METIS: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
12. J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl., 11:134-172, 1990.
13. J. W. H. Liu. The multifrontal method for sparse matrix solution: theory and practice. SIAM Review, 34:82-109, 1992.
14. E. Ng and B. W. Peyton. A supernodal Cholesky factorization algorithm for shared-memory multiprocessors. SIAM J. Sci. Comput., 14:761-769, 1993.
15. A. Pothen and C. Sun. A mapping algorithm for parallel sparse Cholesky factorization. SIAM J. Sci. Comput., 14(5):1253-1257, 1993.
16. P. Raghavan. DSCPACK: Domain-Separator Codes for the parallel solution of sparse linear systems, 2002. Software for solving sparse linear systems on multi-processors an d NOWs using C and MPI. Package has a two stage parallel nested dissection, higher-level BLAS, fast repeated solves and an easy t o use parallel interface. See http://www.cse.psu.edu/Dscpack.
17. P. Raghavan, K. Teranishi, and E. Ng. Scalable parallel preconditioning with incomplete factors. In Proceedings of the Seventh SIAM Conference on Applied Linear Algebra. 2000.
18. P. Raghavan, K. Teranishi, and E. Ng. A latency tolerant hybrid sparse solver using incomplete Cholesky factorization. Numerical Linear Algebra, 10:541-560, 2003.
19. Y. Saad. Iterative Methods for Sparse Linears Systems. PWS Publishing Co., Boston, MA, 1996.
20. C. Yang, P. Raghavan, L. Arrowood, B. Sumpter, and D. Noid. Large-scale normal coordinate analysis on distributed memory mu ltiprocessors and nows. Int. J. Supercomputing Appl., 1(4):409-424, 2002.