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 og22n) time steps and n3/ 8 + 0O2) processors are sufficient. We also show that mth order linear recurrences, |
Year | DOI | Venue |
---|---|---|
1975 | 10.1109/T-C.1975.224291 | IEEE Trans. Computers |
Keywords | Field | DocType |
multidimensional systems,linear system of equations,pipelines,linear systems,parallel computation,linear system,frequency,concurrent computing,computer science,vectors,parallel computer,bandwidth | Discrete mathematics,Combinatorics,System of linear equations,Parallel processing,SIMD,Bandwidth (signal processing),Triangular matrix,Mathematics,Column vector | Journal |
Volume | Issue | ISSN |
24 | 7 | 0018-9340 |
Citations | PageRank | References |
52 | 55.31 | 5 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shyh-Ching Chen | 1 | 295 | 260.23 |
David J. Kuck | 2 | 52 | 55.31 |