REVIEW 1 cited by
Highly Parallel Sparse Matrix-Matrix Multiplication
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Highly Parallel Sparse Matrix-Matrix Multiplication
read the original abstract
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hypersparse kernel for scalability. We give a state-of-the-art MPI implementation of one of our algorithms. Our experiments show scaling up to thousands of processors on a variety of test scenarios.
Forward citations
Cited by 1 Pith paper
-
A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures
Introduces a 2D cyclic decomposition triangle counting algorithm for distributed-memory systems achieving 3.24-7.22x relative speedup on 169 MPI ranks and 10.2x over prior distributed algorithms.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.