Mapping nested loop algorithms into multidimensional systolic arrays
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 1 (1) , 64-76
- https://doi.org/10.1109/71.80125
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Independent partitioning of algorithms with uniform dependenciesIEEE Transactions on Computers, 1992
- Minimum distance: a method for partitioning recurrences for multiprocessorsIEEE Transactions on Computers, 1989
- Synthesizing linear array algorithms from nested FOR loop algorithmsIEEE Transactions on Computers, 1988
- Broadcast normalization in systolic designIEEE Transactions on Computers, 1988
- Optimal Systolic Design for the Transitive Closure and the Shortest Path ProblemsIEEE Transactions on Computers, 1987
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear ArraysIEEE Transactions on Computers, 1986
- A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)Computing, 1985
- The Design of Optimal Systolic ArraysIEEE Transactions on Computers, 1985
- A Wavefront Notation Tool for VLSI Array DesignPublished by Springer Nature ,1981
- The parallel execution of DO loopsCommunications of the ACM, 1974