Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers
Jaeyoung Choi, DAVID W. WALKER, Jack J. Dongarra · Concurrency Practice and Experience · 1994
Abstract The paper describes Parallel Universal Matrix Multiplication Algorithms (PUMMA) on distributed memory concurrent computers. The PUMMA package includes not only the non‐transposed matrix multiplication routine C = A ⋅ B, but also transposed multiplication routines C = AT ⋅ B, C = A ⋅ BT, and C = AT ⋅ BT, for a block cyclic data distribution. The routines perform efficiently for a wide range of processor configurations and block sizes. The PUMMA together provide the same functionality as the Level 3 BLAS routine xGEMM. Details of the parallel implementation of the routines are given, and results are presented for runs on the Intel Touchstone Delta computer.
Cited by 151 works. doi:10.1002/cpe.4330060702
Authors
References
- A set of level 3 basic linear algebra subprograms
- Solving Linear Systems on Vector and Shared Memory Computers.
- A proposal for a user-level, message passing interface in a distributed memory environment
- Proceedings SUPERCOMPUTING '90
- Matrix algorithms on a hypercube I: Matrix multiplication
- ScaLAPACK: a scalable linear algebra library for distributed memory concurrent computers
- A look at scalable dense linear algebra libraries
- A proposal for a user-level, message passing interface in a distributed memory environment
- Two dimensional basic linear algebra communication subprograms
- Matrix multiplication on the Intel Touchstone Delta