8 citations · 19 across the 3 of their papers we have counts for
4 papers
The MOMMS Family of Matrix Multiplication Algorithms
Tyler M. Smith, Robert A. van de Geijn
As the ratio between the rate of computation and rate with which data can be retrieved from various layers of memory continues to deteriorate, a question arises: Will the current b…
A Tight I/O Lower Bound for Matrix Multiplication
Tyler Michael Smith, Bradley Lowery, Julien Langou +1
A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker low…
Automating the Last-Mile for High Performance Dense Linear Algebra
Richard Michael Veras, Tze Meng Low, Tyler Michael Smith +2
High performance dense linear algebra (DLA) libraries often rely on a general matrix multiply (Gemm) kernel that is implemented using assembly or with vector intrinsics. In particu…
Implementing Strassen's Algorithm with BLIS
Jianyu Huang, Tyler M. Smith, Greg M. Henry +1
We dispel with "street wisdom" regarding the practical implementation of Strassen's algorithm for matrix-matrix multiplication (DGEMM). Conventional wisdom: it is only practical fo…