Communication Optimal Parallel Multiplication of Sparse Random Matrices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Communication Optimal Parallel Multiplication of Sparse Random Matrices

Domains

Distributed, Parallel, and Cluster Computing [cs.DC]

Laura Grigori  : Connect in order to contact the contributor

https://inria.hal.science/hal-00870940

Submitted on : Tuesday, October 8, 2013-2:06:20 PM

Last modification on : Saturday, April 27, 2024-3:11:32 AM

No file

Dates and versions

hal-00870940 , version 1 (08-10-2013)

Identifiers

  • HAL Id : hal-00870940 , version 1

Cite

Grey Ballard, Aydin Buluc, James W. Demmel, Laura Grigori, Benjamin Lipshitz, et al.. Communication Optimal Parallel Multiplication of Sparse Random Matrices. 25th ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2013, Montreal, Canada. ⟨hal-00870940⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 UPMC CNRS INRIA INSMI LJLL INRIA2 SORBONNE-UNIVERSITE SU-SCIENCES
101 View
0 Download

Share

Gmail Facebook X LinkedIn More