Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays

DOI10.1109/TC.1986.1676700zbMath0621.68025OpenAlexW1820383994MaRDI QIDQ3757394

Peter J. Varman, I. V. Ramakrishnan

Publication date: 1986

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1986.1676700

zbMATH Keywords

parallel processingVLSIlinear arrayarray processorsmatrix multiplication algorithmsextensible algorithmsprocessor- memory tradeoff

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Theory of operating systems (68N25)

Related Items (3)

Mapping dynamic programming onto modular linear systolic arrays ⋮ Calculating an inverse matrix for lower triangular matrix using a two-processor system ⋮ Computation of higher-order cross moments based on matrix multiplication

This page was built for publication: Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays