The Community for Technology Leaders
Green Image
Issue No. 03 - March (1981 vol. 30)
ISSN: 0018-9340
pp: 190-206
D.D. Gajski , Department of Computer Science, University of Illinois
A new algorithm for the solution of linear recurrence systems on parallel or pipelined computers is described. Time bounds, speed-up and efficiency for SIMD and MIMD computers with fixed number of arithmetic elements (AE's), as well as for pipelined computers with fixed number of stages per operation, are obtained. The model of each computer is discussed in detail to explain better performance of the pipelined model. A simple modification in the design of AE's for parallel computers makes parallel model superior.
triangular system solvers, Complexity of algorithms, computer organization, linear recurrences, parallel evaluation, parallel processors, pipelined processors

D. Gajski, "An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines," in IEEE Transactions on Computers, vol. 30, no. , pp. 190-206, 1981.
92 ms
(Ver 3.3 (11022016))