| Autor: |
T. Harris, K. K. Mathur, S. L. Johnsson |
| Rok vydání: |
1989 |
| Předmět: |
|
| Zdroj: |
SC |
| DOI: |
10.1145/76263.76298 |
| Popis: |
A data parallel implementation of the multiplication of matrices of arbitrary shapes and sizes is presented. A systolic algorithm based on a rectangular processor layout is used by the implementation. All processors contain submatrices of the same size for a given operand. Matrix-vector multiplication is used as a primitive for local matrix-matrix multiplication in the Connection Machine system CM-2 implementation. The peak performance of the local matrix-matrix multiplication is in excess of 20 Gflops s-1. The overall algorithm including all required data motion has a peak performance of 5.8 Gflops s-1. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
