DocumentCode
1143750
Title
An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines
Author
Gajski, Daniel D.
Author_Institution
Department of Computer Science, University of Illinois
Issue
3
fYear
1981
fDate
3/1/1981 12:00:00 AM
Firstpage
190
Lastpage
206
Abstract
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.
Keywords
Complexity of algorithms; computer organization; linear recurrences; parallel evaluation; parallel processors; pipelined processors; triangular system solvers; Algorithm design and analysis; Computer architecture; Computer science; Concurrent computing; Costs; Design methodology; Digital arithmetic; Parallel machines; Parallel processing; Power system modeling; Complexity of algorithms; computer organization; linear recurrences; parallel evaluation; parallel processors; pipelined processors; triangular system solvers;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1981.1675755
Filename
1675755
Link To Document