Solving triangular linear systems in parallel using substitution

Research output: Contribution to journalConference articlepeer-review

Abstract

Working within the LogP model, we present parallel triangular solvers which use forward/backward substitution and show that they are optimal. We begin by deriving several lower bounds on execution time for solving triangular linear systems. Specifically, we derive lower bounds in which it is assumed that the number of data items per processor is bounded, a general lower bound, and lower bounds for specific data layouts commonly used for this problem. Furthermore, algorithms are provided which have running times within a constant factor of the lower bounds described. One interesting result is that the popular 2-dimensional block matrix layout necessarily results in significantly longer running times than simpler one-dimensional schemes. Finally, we present a generalization of the lower bounds to banded triangular linear systems.

Original languageEnglish (US)
Pages (from-to)553-560
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Dec 1 1995
Externally publishedYes
EventProceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, USA
Duration: Oct 25 1995Oct 28 1995

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Solving triangular linear systems in parallel using substitution'. Together they form a unique fingerprint.

Cite this