Login / Signup
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
Grey Ballard
James Demmel
Olga Holtz
Benjamin Lipshitz
Oded Schwartz
Published in:
CoRR (2012)
Keyphrases
</>
matrix multiplication
lower bound
message passing
memory usage
computational complexity
learning algorithm
memory requirements
worst case
upper and lower bounds
online algorithms
np hard
scheduling problem
upper bound
semi supervised
memory space