Notes on the complexity of systolic programs
- 1 June 1987
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 4 (3) , 250-265
- https://doi.org/10.1016/0743-7315(87)90036-0
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A layered method for process and code mappingNew Generation Computing, 1987
- Concurrent Prolog: A Progress ReportComputer, 1986
- Why systolic architectures?Computer, 1982
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- Communication Issues in the Design and Analysis of Parallel AlgorithmsIEEE Transactions on Software Engineering, 1981
- Some Complexity Results for Matrix Computations on Parallel ProcessorsJournal of the ACM, 1978
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977