Issue No. 11 - November (1982 vol. 31)
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.)
parallel processing, Interconnection networks, limited processor algorithms, linear recurrences, numerical stability, parallel memory storage schemes
R. Montoye and D. Lawrie, "A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System," in IEEE Transactions on Computers, vol. 31, no. , pp. 1076-1082, 1982.