PAT is a buffer-limited all-gather and reduce-scatter algorithm for arbitrary rank counts that mixes logarithmic and linear communication phases to cut latency at scale.
Optimization of collective com- munication operations in mpich,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
PAT: a new algorithm for all-gather and reduce-scatter operations at scale
PAT is a buffer-limited all-gather and reduce-scatter algorithm for arbitrary rank counts that mixes logarithmic and linear communication phases to cut latency at scale.