Performance optimizations and bounds for sparse matrix-vector multiply

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Richard Vuduc University of California, Berkeley, Berkeley, California
James W. Demmel University of California, Berkeley, Berkeley, California
Katherine A. Yelick University of California, Berkeley, Berkeley, California
Shoaib Kamil University of California, Berkeley, Berkeley, California
Rajesh Nishtala University of California, Berkeley, Berkeley, California
Benjamin Lee University of California, Berkeley, Berkeley, California
Performance optimizations and bounds for sparse matrix-vector multiply 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 24
· Downloads (cumulative): 653
· Citation Count: 29

Published in:
Cover Image
 
· Proceeding
Supercomputing '02 Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Pages 1-35
IEEE Computer Society Press Los Alamitos, CA, USA ©2002
table of contents

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