Mapping dynamic programming onto modular linear systolic arrays
From MaRDI portal
Publication:2365569
DOI10.1007/BF02242705zbMath0781.68066MaRDI QIDQ2365569
Publication date: 29 June 1993
Published in: Distributed Computing (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An incremental mechanical development of systolic solutions to the algebraic path problem
- Computing transitive closure on systolic arrays of fixed size
- Dynamic programming on two-dimensional systolic arrays
- Dynamic programming on linear pipelines
- Synthesizing synchronous systems by static scheduling in space-time
- A modular systolic linear array for gaussian elimination
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- Mapping Homogeneous Graphs on Linear Arrays
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
- Synthesizing linear array algorithms from nested FOR loop algorithms
- The Parallel Recognition of Classes of Graphs
- Partitioned Matrix Algorithms for VLSI Arithmetic Systems
- The synthesis of control signals for one-dimensional systolic arrays
- Mapping dynamic programming onto a linear systolic array