Brief announcement: strong scaling of matrix multiplication algorithms and memoryindependent communication lower bounds
Authors:

Grey Ballard

UC Berkeley, Berkeley, CA, USA


James Demmel

UC Berkeley, Berkeley, CA, USA


Olga Holtz

UC Berkeley and TU Berlin, Berkeley, CA, USA


Benjamin Lipshitz

UC Berkeley, Berkeley, CA, USA


Oded Schwartz

UC Berkeley, Berkeley, CA, USA



2012 Article

Bibliometrics

· Downloads (6 Weeks): 7
· Downloads (12 Months): 30
· Downloads (cumulative): 135
· Citation Count: 10


Published in:


· Proceeding 
SPAA '12 Proceedings of the twentyfourth annual ACM symposium on Parallelism in algorithms and architectures

Pages 7779
ACM New York, NY, USA ©2012
table of contents
ISBN: 9781450312134
doi>10.1145/2312005.2312021


powered by

