This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System
November 1982 (vol. 31 no. 11)
pp. 1076-1082
R.K. Montoye, Department of Computer Science, University of Illinois
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 O 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.)
Index Terms:
parallel processing, Interconnection networks, limited processor algorithms, linear recurrences, numerical stability, parallel memory storage schemes
Citation:
R.K. Montoye, D.H. Lawrie, "A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System," IEEE Transactions on Computers, vol. 31, no. 11, pp. 1076-1082, Nov. 1982, doi:10.1109/TC.1982.1675924
Usage of this product signifies your acceptance of the Terms of Use.