An algorithm for multiplication of concatenated matrices (Q911227)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4141405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for multiplication of concatenated matrices |
scientific article; zbMATH DE number 4141405 |
Statements
An algorithm for multiplication of concatenated matrices (English)
0 references
1990
0 references
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.
0 references
matrix multiplication
0 references
systolic arrays
0 references
parallel computers
0 references
parallel algorithm
0 references
0.8351522088050842
0 references
0.8292758464813232
0 references
0.8212629556655884
0 references
0.8094658255577087
0 references
