Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Laura Grigori INRIA Saclay-Ile de France, Orsay, France
Pierre-Yves David INRIA Saclay-Ile de France, Orsay, France
James W. Demmel Departments of Mathematics and CS, University of California Berkeley, Berkeley, USA
Sylvain Peyronnet LRI, Université Paris-Sud 11, Orsay, France
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem Published by ACM 2010 Article
  • Short paper
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 13
· Downloads (cumulative): 69
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
SPAA '10 Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
Pages 79-81
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0079-7 doi>10.1145/1810479.1810496

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