论文信息 - Sparse LU factorization on the CRAY T3D

Sparse LU factorization on the CRAY T3D

The paper describes a parallel algorithm for the LU factorization of sparse matrices on distributed memory machines by using SPMD as programming model and PVM as message passing interface. We address all the difficulties arising in sparse codes, as the fill-in or the dynamic movement of data inside the matrix. The cyclic distribution has been used to evenly distribute the elements onto a mesh of processors, whereas two local storage schemes are proposed: A semi-ordered and two-dimensional linked list, which fulfils better the requirements of the algorithm, and a compressed storage by rows, which behaves better in the use of memory. The properties of the code are extensively analyzed and execution times on the CRAY T3D are presented to illustrate the overall efficiency achieved by our methods.

Rafael Asenjo | Emilio L. Zapata | E. Zapata | R. Asenjo

[1] H. Markowitz. The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[2] Z. Zlatev. Computational Methods for General Sparse Matrices , 1991 .

[3] T. Davis,et al. A nondeterministic parallel algorithm for general unsymmetric sparse lu factorization , 1990 .

[4] Jack Dongarra,et al. Pvm 3 user's guide and reference manual , 1993 .

[5] John K. Reid,et al. Some Design Features of a Sparse Matrix Code , 1979, TOMS.

[6] Rafael Asenjo,et al. Sparse Block and Cyclic Data Distributions for Matrix Computations , 1995 .

[7] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.

[8] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .

[9] Gene H. Golub,et al. Matrix computations , 1983 .

[10] J. G. G. Vorst,et al. Parallel Sparse LU Decomposition on a Mesh Network of Transputers , 1993, SIAM J. Matrix Anal. Appl..

[11] Zahari Zlatev,et al. Y12M - Solution of Large and Sparse Systems of Linear Algebraic Equations , 1981, Lecture Notes in Computer Science.