Parallel Matrix Multiplication: A Systematic Journey

DOI10.1137/140993478zbMath1355.65060OpenAlexW2565436413MaRDI QIDQ2954477

Jack Poulson, Martin D. Schatz, Robert A. van de Geijn

Publication date: 13 January 2017

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6dec047d398d24e5b621cf343d2de593488b5d39

zbMATH Keywords

algorithmparallel processingmatrix-vector multiplicationmatrix-matrix multiplication

Mathematics Subject Classification ID

Related Items (3)

A test for the absence of aliasing or white noise in two-dimensional locally stationary wavelet processes ⋮ A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering ⋮ Massively parallel sparse matrix function calculations with NTPoly

Uses Software

• FLAME
• LAPACK
• ScaLAPACK
• SUMMA
• PLAPACK
• libflame
• Elemental
• PUMMA

Cites Work

• Unnamed Item
• Communication and matrix computations on large message passing systems
• Memory-efficient matrix multiplication in the BSP model
• Communication lower bounds for distributed-memory matrix multiplication
• Programming matrix algorithms-by-blocks for thread-level parallelism
• Elemental
• Anatomy of high-performance matrix multiplication
• LAPACK Users' Guide
• The Torus-Wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers
• Communication lower bounds and optimal algorithms for numerical linear algebra
• FLAME
• An inequality related to the isoperimetric inequality

This page was built for publication: Parallel Matrix Multiplication: A Systematic Journey