Blocking for parallel sparse linear system solvers Conference Paper

abstract

• The parallel solution of sparse systems of linear equations is discussed. In such systems, parallelism and communication patterns are dependent on the nature of sparsity in the input matrix system. An algorithm, Block Solve, in which processors access blocks of rows from shared memory, is described. Experiments were carried out on the eight-processor Alliant FX/8 to determine the effectiveness of various blocking strategies in reducing execution times. An average block size of between four and eight minimized execution times. The Alliant FX/8 was used to emulate the execution of Block Solve on a shared-memory multiprocessor with private memories.

authors

• Davis, Timothy

published proceedings

• Proceedings of the International Conference on Parallel Processing

author list (cited authors)

• Abraham, S. G., & Davis, T. A.

complete list of authors

• Abraham, SG||Davis, TA

publication date

• December 1988

published in

• Proceedings of the International Conference on Parallel Processing  Journal

start page

• 166

end page

• 173

volume

• 1