Partitioning: An Essential Step in Mapping Algorithms Into Systolic Array Processors
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 20 (7) , 77-89
- https://doi.org/10.1109/mc.1987.1663622
Abstract
The efficient solution of a large problem on a small systolic array requires good partitioning techniques to split the problem into subproblems that fit the array size.Peer ReviewedPostprint (published versionKeywords
This publication has 8 references indexed in Scilit:
- Systematic approaches to the design of algorithmically specified systolic arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Computing size-independent matrix problems on systolic array processorsACM SIGARCH Computer Architecture News, 1986
- Partitioning and Mapping Algorithms into Fixed Size Systolic ArraysIEEE Transactions on Computers, 1986
- VLSI Array processorsIEEE ASSP Magazine, 1985
- Algorithm partition for a fixed-size VLSI architecture using space-time domain expansionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A versatile systolic array for matrix computationsACM SIGARCH Computer Architecture News, 1985
- Wafer-scale integration and two-level pipelined implementations of systolic arraysJournal of Parallel and Distributed Computing, 1984
- Why systolic architectures?Computer, 1982