Presentation
Bine Trees: Enhancing Collective Operations by Optimizing Communication Locality
DescriptionCommunication locality plays a key role in the performance of collective operations on large HPC systems, especially on oversubscribed networks where groups of nodes are fully connected internally but sparsely linked through global connections. We present \Bine (\textit{\underline{bi}nomial \underline{ne}gabinary}) trees, a family of collective algorithms that improve communication locality.
\Bine trees maintain the generality of binomial trees and butterflies while cutting global-link traffic by up to $33\%$. We implement eight \Bine-based collectives and evaluate them on four large-scale supercomputers with Dragonfly, Dragonfly+, oversubscribed fat-tree, and torus topologies, achieving up to $5\times$ speedups and consistent reductions in global-link traffic across different vector sizes and node counts.
\Bine trees maintain the generality of binomial trees and butterflies while cutting global-link traffic by up to $33\%$. We implement eight \Bine-based collectives and evaluate them on four large-scale supercomputers with Dragonfly, Dragonfly+, oversubscribed fat-tree, and torus topologies, achieving up to $5\times$ speedups and consistent reductions in global-link traffic across different vector sizes and node counts.
Authors
Event Type
Paper
TimeThursday, 20 November 20251:30pm - 1:52pm CST
Location275
Architectures & Networks
Similar Presentations