论文信息 - A compute-ahead implementation of the fan-in sparse distributed factorization scheme

A compute-ahead implementation of the fan-in sparse distributed factorization scheme

In this report, we consider a compute-ahead computational technique in the distributed factorization of large sparse matrices using the fan-in parallel scheme. Experimental results on an Intel iPSC/2 hypercube are provided to demonstrate the relevance and effectiveness of this technique. Fortran source code is also included in an appendix. 9 refs., 2 figs., 1 tab.

Joseph W. H. Liu | Cleve Ashcraft | Stanley C. Eisenstat | A. H. Sherman | B. W. Peyton

[1] G. A. Geist,et al. A machine-independent communication library , 1989 .

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

[3] P. Lax. Mathematics and computing , 1986 .

[4] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .

[5] Michael T. Heath,et al. Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .

[6] C S McDowell. NAVAL RESEARCH. , Science.

[7] Alan George,et al. Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..

[8] George E. Forsythe,et al. Computer science and mathematics , 1970, SGCS.

[9] Barry W. Peyton,et al. Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .

[10] Cleve Ashcraft,et al. A Fan-In Algorithm for Distributed Sparse Numerical Factorization , 1990, SIAM J. Sci. Comput..

[11] Laurie A. Hulbert,et al. Limiting Communication in Parallel Sparse Cholesky Factorization , 1991, SIAM J. Sci. Comput..