Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

Full Text: PDFPDF Buy this ArticleBuy this Article
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
Published by ACM 2012 Article
  • Abstract
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 58
· Downloads (cumulative): 58
· Citation Count: 4

Published in:
Cover Image
 
· Proceeding
SPAA '12 Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures
Pages 77-79
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1213-4 doi>10.1145/2312005.2312021

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder