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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.