Parallel algorithms for forward and back substitution in direct solution of sparse linear systems

Anshul Gupta, Vipin Kumar

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

Abstract

A few parallel algorithms for solving triangular systems resulting from parallel factorization of sparse linear systems have been proposed and implemented recently. We present a detailed analysis of parallel complexity and scalability of the best of these algorithms and the results of its implementation on up to 256 processors of the Cray T3D parallel computer. It has been a common belief that parallel sparse triangular solvers are quite unscalable due to a high communication to computation ratio. Our analysis and experiments show that, although not as scalable as the best parallel sparse Cholesky factorization algorithms, parallel sparse triangular solvers can yield reasonable speedups in runtime on hundreds of processors. We also show that for a wide class of problems, the sparse triangular solvers described in this paper are optimal and are asymptotically as scalable as a dense triangular solver.

Original languageEnglish (US)
Pages (from-to)2042-2063
Number of pages22
JournalProceedings of the ACM/IEEE Supercomputing Conference
Volume2
StatePublished - Dec 1 1995
EventProceedings of the 1995 ACM/IEEE Supercomputing Conference. Part 2 (of 2) - San Diego, CA, USA
Duration: Dec 3 1995Dec 8 1995

Fingerprint Dive into the research topics of 'Parallel algorithms for forward and back substitution in direct solution of sparse linear systems'. Together they form a unique fingerprint.

Cite this