SIGN IN
SIGN UP
Sparse matrix factorization on massively parallel computers
Full Text:
Pdf
Buy this Article
Authors:
Anshul Gupta
IBM Watson Research Center, Yorktown Heights, NY
Seid Koric
University of Illinois, Urbana, IL
Thomas George
Texas A & M University, College Station, TX
Published in:
· Proceeding
SC '09
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-744-8
doi>
10.1145/1654059.1654061
2009 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 113
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SC'12
Share:
|
Tags:
algorithms
computations on matrices
design
error correction, last-level caches, reliability, soft error
number-theoretic computations
parallel algorithms
performance
sparse, structured, and very large systems
super computers
theory
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