Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

DOI10.1016/J.JPDC.2005.07.008MaRDI QIDQ2369680zbMATH OpenOpenAlexFDO

Authors Clémentin Tayou Djamegni

Publication date 22 May 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.07.008

zbMATH Keywords

fully pipelinedmatrix productmodular linear systolic algorithmspartially pipelinedspace-time complexity

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4098617
• Modular Matrix Multiplication on a Linear Array
• scientific article; zbMATH DE number 3921974
• Optimal systolic array algorithms for tensor product
• Modular matrix computations on multi-linear VLSI arrays

Cited in

(4)

• Complexity of the pipeline computation of a family of inner products
• scientific article; zbMATH DE number 3921974 (Why is no real title available?)
• scientific article; zbMATH DE number 1985711 (Why is no real title available?)
• A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

This page was built for publication: Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules

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