Geometrical tools to map systems of affine recurrence equations on regular arrays
From MaRDI portal
Publication:1323382
DOI10.1007/BF01192158zbMath0790.68088OpenAlexW2006169550MaRDI QIDQ1323382
Philippe Clauss, Catherine Mongenet, Guy-René Perrin
Publication date: 10 May 1994
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01192158
matrix multiplicationaffine recurrence equationsregular arraysrecursive convolutionLL\(^ t\) Cholesky factorizationsynchronous processor arrays
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Dedicated hardware for linearly-scaling algorithms in condensed-matter physics ⋮ Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
Cites Work
- Unnamed Item
- Unnamed Item
- Computability of recurrence equations
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
- Mapping uniform loop nests onto distributed memory architectures
- An orthogonal systolic array for the algebraic path problem
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- The mapping of linear recurrence equations on regular arrays
- The Organization of Computations for Uniform Recurrence Equations
- A New Version of the Euclidean Algorith
This page was built for publication: Geometrical tools to map systems of affine recurrence equations on regular arrays
