# A Framework for Practical Parallel Fast Matrix Multiplication

@inproceedings{Benson2015AFF, title={A Framework for Practical Parallel Fast Matrix Multiplication}, author={Austin R. Benson and Grey Ballard}, booktitle={PPOPP}, year={2015} }

Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and Strassen's fast algorithm on modest problem sizes and shapes. Furthermore, we show that the best choice of fast algorithm depends not only on the size of the matrices but also the shape. We develop a code generation tool to automatically implement multiple… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-6 OF 6 CITATIONS

## Implementing Strassen's Algorithm with CUTLASS on NVIDIA Volta GPUs

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## Performance Optimization for the K-Nearest Neighbors Kernel using Strassen ’ s Algorithm

VIEW 1 EXCERPT

CITES METHODS

## The geometry of rank decompositions of matrix multiplication I: 2x2 matrices

VIEW 2 EXCERPTS

CITES METHODS