A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System

An algorithm is presented for a more efficient and implementable solution of triangular systems on a parallel (SIMD) computer which requires 0(log (N)) fewer processing cycles than the best previous results, where N is the system size. We will also show that the data can be accessed and aligned in t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-31; no. 11; pp. 1076 - 1082
Main Authors Montoye, R K, Lawrie, D H
Format Journal Article
LanguageEnglish
Published IEEE 01.11.1982
Subjects
Interconnection networks
limited processor algorithms
linear recurrences
numerical stability
parallel memory storage schemes
parallel processing
Online AccessGet full text

Cover

More Information
Summary:An algorithm is presented for a more efficient and implementable solution of triangular systems on a parallel (SIMD) computer which requires 0(log (N)) fewer processing cycles than the best previous results, where N is the system size. We will also show that the data can be accessed and aligned in the same order of time using as many memory units as processors and Ω networks for data alignment. (Previous results dealing with this type of algorithm have not dealt in any detail with the problem of data access and alignment.)
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1982.1675924