Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays
- 1 July 1989
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 11 (1) , 93-106
- https://doi.org/10.1016/0167-8191(89)90065-3
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An asymptotically optimal layout for the shuffle—exchange graphJournal of Computer and System Sciences, 1983
- Why systolic architectures?Computer, 1982
- Networks and algorithms for very-large-scale parallel computationComputer, 1982
- An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined MachinesIEEE Transactions on Computers, 1981
- A Survey of Parallel Machine Organization and ProgrammingACM Computing Surveys, 1977
- Time and Parallel Processor Bounds for Linear Recurrence SystemsIEEE Transactions on Computers, 1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973
- The Parallel Evaluation of Arithmetic Expressions Without DivisionIEEE Transactions on Computers, 1973
- Optimal algorithms for parallel polynomial evaluationJournal of Computer and System Sciences, 1973