Abstract
A new matrix multiplication algorithm is proposed for massively parallel supercomputerswith 2D/3D, all-port torus interconnection networks. The proposed algorithm is based on the traditional row-by-column multiplication matrix product model and employs a special routing pattern for better scalability. It compares favorably tothe variants of Cannon’s and DNS algorithms since it allows matrices of the same size to be multiplied on a higher number of processors due to lower data communications overhead.
| Original language | English |
|---|---|
| Title of host publication | Mathematical Methods in Engineering |
| Publisher | Springer Netherlands |
| Pages | 13-21 |
| Number of pages | 9 |
| ISBN (Electronic) | 9789400771833 |
| ISBN (Print) | 9789400771826 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
Keywords
- 2D Torus
- 3D Torus
- Fast matrix multiplication
- Parallel processing
- Torus interconnection networks
Fingerprint
Dive into the research topics of 'A new parallel matrix multiplication algorithm for wormhole-routed all-port 2D/3D torus networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver