A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System
- 1 November 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (11) , 1076-1082
- https://doi.org/10.1109/tc.1982.1675924
Abstract
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.)Keywords
This publication has 3 references indexed in Scilit:
- Solving Triangular Systems on a Parallel ComputerSIAM Journal on Numerical Analysis, 1977
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- Time and Parallel Processor Bounds for Linear Recurrence SystemsIEEE Transactions on Computers, 1975