The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Parallelism exposure and exploitation in programs
Parallelism exposure and exploitation in programs
Memory-processor connection networks
Memory-processor connection networks
IEEE Transactions on Computers
The Organization and Use of Parallel Memories
IEEE Transactions on Computers
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
IEEE Transactions on Computers
The Parallel Solution of Triangular Systems of Equations
IEEE Transactions on Computers
An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined Machines
IEEE Transactions on Computers
The Burroughs Scientific Processor (BSP)
IEEE Transactions on Computers
Combinational Circuit Synthesis with Time and Component Bounds
IEEE Transactions on Computers
A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System
IEEE Transactions on Computers
Measuring the Parallelism Available for Very Long Instruction Word Architectures
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Short communication: Parallel marching Poisson solvers
Parallel Computing
Parallelism and Array Processing
IEEE Transactions on Computers
Automatic parallelization using the value evolution graph
LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing
Parallel solution of band triangular linear systems on VLSI arrays with limited fan-out
Journal of Systems and Software
| Hi-index | 15.01 |
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,