An algorithm for multiplication of concatenated matrices
type: Item
instance of: scholarly article
title: An algorithm for multiplication of concatenated matrices
zbMATH Open document ID: 0696.65039
DOI: 10.1016/0167-8191(90)90148-3
published in: Parallel Computing
publication date: 1990-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4141405
zbMATH Keywords: matrix multiplication
zbMATH Keywords: systolic arrays
zbMATH Keywords: parallel computers
zbMATH Keywords: parallel algorithm
author: M. K. Stojčev
author: E. I. Milovanović
author: Igor Ž. Milovanović
MaRDI profile type: Publication
full work available at URL: 0167-8191(90)90148-3
OpenAlex ID: W2008774601
description: scientific article; zbMATH DE number 4141405