论文信息 - The ijk forms of factorization methods II. Vector computers

The ijk forms of factorization methods II. Vector computers

Abstract We consider the “ ijk forms” of LU and Cholesky factorization on certain parallel computers. This extends the analysis for vector computers of Part I of this work. We restrict attention to local memory systems with processors that may or may not have vector capability. Special attention is given to bus architectures but qualitative analyses are given for other interconnection systems.

J. M. Ortega | J. Ortega

[1] Ilse C. F. Ipsen,et al. Complexity of dense linear system solution on a multiprocessor ring. Research report , 1986 .

[2] A. George,et al. Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .

[3] J. Ortega,et al. Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[4] Charles H. Romine,et al. $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures , 1988 .

[5] F. Gustavson,et al. Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .

[6] J. M. Ortega,et al. The ijk forms of factorization methods I. Vector computers , 1988, Parallel Comput..

[7] Michael T. Heath,et al. Parallel solution of triangular systems on distributed-memory multiprocessors , 1988 .

[8] J. D. Knott. A performance analysis of the PASLIB version 2.1X SEND and RECV routines on the finite element machine , 1983 .

[9] Dianne P. O'Leary,et al. Data-flow algorithms for parallel matrix computation , 1985, CACM.

[10] H. F. Jordan. A Special Purpose Architecture for Finite Element Analysis , 1978 .

[11] M. Heath,et al. Matrix factorization on a hypercube multiprocessor , 1985 .