Poster Type: ACM SRC Posters
Author: Souvadra Hati (Georgia Tech), Richard Vuduc (Georgia Tech)
Abstract: Irregular distributed-memory applications often perform local computation and memory operations around a many-to-many communication exchange. We introduce AllScatterApply (ASAP), a fused collective communication primitive for this pattern. ASAP overlaps local and remote operations at fine granularity, scales to 32,000 CPU cores on NERSC Perlmutter, and delivers up to 74× speedup over point-to-point implementations built on the same one-sided runtime library.
We evaluate ASAP on genomic k-mer counting (KC) and connected components (CC). For KC, ASAP achieves 2×–5× speedup over bulk-synchronous parallel (BSP) baselines and matches the performance of a hand-tuned asynchronous algorithm. For CC, ASAP is 1.8× faster than both optimized BSP and asynchronous baselines. By avoiding expensive graph partitioning, ASAP also achieves 8.8× faster end-to-end performance than a dedicated asynchronous graph-processing system.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF