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

DOI10.1109/TC.1986.1676700zbMATH Open0621.68025OpenAlexW1820383994MaRDI QIDQ3757394FDOQ3757394

Authors: 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

Recommendations

• A family of new efficient arrays for matrix multiplication
• On an optimal algorithm for matrix multiplication
• scientific article; zbMATH DE number 4084839
• An optimal algorithm for matrix multiplication
• A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
• scientific article; zbMATH DE number 1728263
• scientific article; zbMATH DE number 988720
• Matrix-vector multiplication on a fixed-size linear systolic array
• On practical algorithms for accelerated matrix multiplication
• scientific article; zbMATH DE number 4072257

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)

Cited In (6)

• A family of new efficient arrays for matrix multiplication
• Mapping dynamic programming onto modular linear systolic arrays
• Calculating an inverse matrix for lower triangular matrix using a two-processor system
• Title not available (Why is that?)
• Modular Matrix Multiplication on a Linear Array
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757394)