Synthesizing systolic arrays from recurrence equations

DOI10.1016/0167-8191(90)90105-IzbMath0712.65118OpenAlexW2085551696MaRDI QIDQ749184

Richard M. Fujimoto, Sanjay V. Rajopadhye

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90105-i

zbMATH Keywords

systolic arraysrecurrence relationssystolic architecturetiming and allocation functions

Mathematics Subject Classification ID

Related Items (11)

Advanced Regular Array Design ⋮ Systolic SVD and QR Decomposition by Householder Reflections ⋮ Space-Time Equations for Non-Unimodular Mappings ⋮ Fine-grained multi-phase array designs ⋮ Algorithm transformations for computational and data broadcast ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ Algorithm transformations for the data broadcast elimination method ⋮ Designing of processor-time optimal systolic arrays for band matrix-vector multiplication ⋮ Towards systolizing compilation ⋮ Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm ⋮ Total unfolding: theory and applications

This page was built for publication: Synthesizing systolic arrays from recurrence equations