An algorithm for multiplication of concatenated matrices

DOI10.1016/0167-8191(90)90148-3MaRDI QIDQ911227zbMATH OpenOpenAlexFDO

Authors M. K. Stojčev, E. I. Milovanović, Igor Ž. Milovanović

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90148-3

zbMATH Keywords

matrix multiplicationparallel algorithmparallel computerssystolic arrays

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Theory of operating systems (68N25)

Review text

The matrices to be multiplied on an \(m*m\) array of nearest neighbour type processors (i.e. each processor has links with the nearest four neighbours) are partitioned into \(m*m\) blocks. A parallel algorithm is shown whose efficiency for a large number of matrix factors tends to one and is therefore optimal. The algorithm uses relatively complex shifting operations and is demonstrated for a \(3*3\) partition at the end of the paper.

Recommendations

• Modular Matrix Multiplication on a Linear Array
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Hypercube matrix multiplication
• scientific article; zbMATH DE number 540183
• An optimal algorithm for matrix multiplication

Cited in

(6)

• A mixed cellular method of matrix multiplication
• Matrix-vector multiplication: Parallel algorithms and architectures
• A balanced submatrix merging algorithm for multiprocessor architectures
• scientific article; zbMATH DE number 2086166 (Why is no real title available?)
• Modular Matrix Multiplication on a Linear Array
• scientific article; zbMATH DE number 540183 (Why is no real title available?)

This page was built for publication: An algorithm for multiplication of concatenated matrices

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