The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1975 vol.24)
pp: 701-717
null Shyh-Ching Chen , Department of Computer Science, University of Illinois
ABSTRACT
We give new time and processor bounds for the parallel evaluation of linear recurrence systems. Such systems may be represented as x? =c? + Ax? where A is an n X n strictly lower triangular matrix and c is a constant column vector. We show that O og<inf>2</inf><sup>2</sup>n) time steps and n<sup>3</sup>/ 8 + 0O<sup>2</sup>) processors are sufficient. We also show that mth order linear recurrences,
INDEX TERMS
General linear recurrences, mth order linear recurrences, parallel computation, processor bounds, time bounds, triangular linear systems.
CITATION
null Shyh-Ching Chen, D.J. Kuck, "Time and Parallel Processor Bounds for Linear Recurrence Systems", IEEE Transactions on Computers, vol.24, no. 7, pp. 701-717, July 1975, doi:10.1109/T-C.1975.224291
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool