Login / Signup
Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds.
Grey Ballard
James Demmel
Olga Holtz
Benjamin Lipshitz
Oded Schwartz
Published in:
SPAA (2012)
Keyphrases
</>
matrix multiplication
lower bound
data structure
worst case
recommender systems
upper bound
memory requirements
highly efficient
lower and upper bounds
upper and lower bounds
memory usage
learning algorithm
optimal solution
dynamic programming
distributed memory
online algorithms