Abstract: The Gustavson's algorithm (i.e., the row-wise product algorithm) shows its potential as the backbone algorithm for sparse matrix-matrix multiplication (SpMM) on hardware accelerators.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results