Login / Signup
Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI.
Alfio Lazzaro
Joost VandeVondele
Jürg Hutter
Ole Schütt
Published in:
PASC (2017)
Keyphrases
</>
sparse matrix
matrix multiplication
np hard
k means
highly efficient
objective function
optimal solution
dynamic programming
scheduling problem
parallel implementation
feature selection
lower bound
message passing
sparse linear