The parallel solution of recurrence problems
The parallel solution of recurrence problems
Online pipeline systems for recursive numeric computations
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The microprogramming of pipelined processors
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines
IEEE Transactions on Computers
| Hi-index | 0.00 |
An m thorder recurrence problem is defined as the computation of X1, . . . XN, where Xi&equil;f (&abarbelowi, Xi-1, . . Xi-m) and &abarbelow;i is a set of parameters. On a pipelined computer, where the total stage delay in computing f is df time units, the solution output rate is one new Xi each df time unit. This paper describes a method for increasing this rate to 1 per time unit when the function f has certain simple functional properties. The total stage delay and complexity of the resulting pipelines are also described.