On mapping systolic algorithms onto the hypercube
- 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) , 48-63
- https://doi.org/10.1109/71.80124
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Performance of the Intel iPSC/860 and Ncube 6400 hypercubesParallel Computing, 1991
- VLSI algorithms for solving recurrence equations and applicationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Partitioning: An Essential Step in Mapping Algorithms Into Systolic Array ProcessorsComputer, 1987
- Designing Systolic Algorithms Using Sequential MachinesIEEE Transactions on Computers, 1986
- Partitioning and Mapping Algorithms into Fixed Size Systolic ArraysIEEE Transactions on Computers, 1986
- Algorithm partition for a fixed-size VLSI architecture using space-time domain expansionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- The Design of Optimal Systolic ArraysIEEE Transactions on Computers, 1985
- Characterizations and computational complexity of systolic trellis automataTheoretical Computer Science, 1984
- On the Analysis and Synthesis of VLSI AlgorithmsIEEE Transactions on Computers, 1982
- Why systolic architectures?Computer, 1982