Some shared memory is desirable in parallel sparse matrix computation
暂无分享,去创建一个
Alan George | Esmond Ng | A. George | E. Ng
[1] David J. Evans,et al. The Parallel Solution of Triangular Systems of Equations , 1983, IEEE Transactions on Computers.
[2] Michael T. Heath,et al. Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .
[3] John R. Gilbert,et al. A Parallel Algorithm for Large Sparse Cholesky Factorization on a Multiprocessor , 1986 .
[4] Andrew Harry Sherman,et al. On the efficient solution of sparse systems of linear and nonlinear equations. , 1975 .
[5] Michael T. Heath,et al. Symbolic Cholesky factorization on a local-memory multiprocessor , 1987, Parallel Comput..
[6] Michael T. Heath,et al. Parallel solution of triangular systems on distributed-memory multiprocessors , 1988 .
[7] James M. Ortega,et al. Parallel solution of triangular systems of equations , 1988, Parallel Comput..
[8] Thomas F. Coleman,et al. A Parallel Triangular Solver for a Hypercube Multiprocessor , 1986 .
[9] Alan George,et al. Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..
[10] Alan George,et al. Gaussian elimination with partial pivoting and load balancing on a multiprocessor , 1987, Parallel Comput..
[11] Earl Edward Zmijewski. Sparse cholesky factorization on a multiprocessor , 1987 .
[12] Charles H. Romine,et al. $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures , 1988 .