Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays
- 1 November 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-35 (11) , 989-996
- https://doi.org/10.1109/TC.1986.1676700
Abstract
Synthesis of a family of matrix multiplication algorithms on a linear array is described. All these algorithms are optimal in their area and time requirements. An important feature of the family of algorithms is that they are modularly extensible, that is, larger problem sizes can be handled by cascading smaller arrays consisting of processors having a fixed amount of local storage. These algorithms exhibit a tradeoff between the number of processors required and the local storage within a processor. In particular, as the local storage increases the number of processors required to multiply the two matrices decrease.Keywords
This publication has 5 references indexed in Scilit:
- Modular Matrix Multiplication on a Linear ArrayIEEE Transactions on Computers, 1984
- Configuration of VLSI Arrays in the Presence of DefectsJournal of the ACM, 1984
- Wafer-scale integration of systolic arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Systolic Processing and an Implementation for Signal and Image ProcessingIEEE Transactions on Computers, 1982
- Why systolic architectures?Computer, 1982