On the Impact of Communication Latencies on Distributed Sparse LU Factorization.
暂无分享,去创建一个
[1] P. Sadayappan,et al. Communication reduction for distributed sparse matrix factorization on a processor mesh , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).
[2] T. Davis,et al. A nondeterministic parallel algorithm for general unsymmetric sparse lu factorization , 1990 .
[3] Michael T. Heath,et al. Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .
[4] Andrzej M. Goscinski,et al. Distributed operating systems - the logical design , 1991 .
[5] Iain S. Duff,et al. The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .
[6] David W. Krumme,et al. Gossiping in Minimal Time , 1992, SIAM J. Comput..
[7] Michael T. Heath,et al. Parallel Algorithms for Sparse Linear Systems , 1991, SIAM Rev..
[8] Uwe H. Suhl,et al. Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases , 1990, INFORMS J. Comput..
[9] Iain S. Duff,et al. Parallel implementation of multifrontal schemes , 1986, Parallel Comput..
[10] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[11] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .
[12] J. G. G. Vorst,et al. Parallel Sparse LU Decomposition on a Mesh Network of Transputers , 1993, SIAM J. Matrix Anal. Appl..