SIGN IN
SIGN UP
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
Full Text:
PDF
Buy this Article
Authors:
Aydin Buluç
University of California, Santa Barbara, Santa Barbara, CA, USA
Jeremy T. Fineman
Massachusetts Institute of Technology, Cambridge, MA, USA
Matteo Frigo
Cilk Arts, Inc., Burlington, MA, USA
John R. Gilbert
University of California, Santa Barbara, Santa Barbara, CA, USA
Charles E. Leiserson
Massachusetts Institute of Technology, Cambridge, MA, USA
2009 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 139
· Citation Count: 3
Published in:
· Proceeding
SPAA '09
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-606-9
doi>
10.1145/1583991.1584053
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '12
Share:
|
Tags:
algorithms
compressed sparse blocks
compressed sparse columns
compressed sparse rows
computations on matrices
design
experimentation
matrix transpose
matrix-vector multiplication
multithreaded algorithm
parallel and vector implementations
parallelism
performance
span
sparse matrix
storage format
theory
work
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder