ForestColl: Throughput-Optimal Collective Communications on Heterogeneous Network Fabrics
summary
ForestColl generates throughput-optimal collective schedules by computing the bottleneck network cut via an optimality binary search, transforming switch topologies into a switch-free logical graph with switch node removal (edge splitting), and applying spanning tree packing to produce broadcast/aggregation trees. Schedule generation runs in polynomial time and maps back with no optimality loss. Evaluation on AMD MI250 and NVIDIA DGX A100 & H100 shows up to 32% higher all-gather throughput and 14–20% faster training iterations versus prior libraries, and much faster schedule synthesis.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:01Collective communications
- 2:06Network topology diversity
- 3:53ForestColl’s spanning tree
- 5:41Optimal throughput via binary search
- 8:34Bottleneck cut for optimality
- 10:03Spanning tree packing
- 11:08Switch node removal
- 12:37Performance results
- 14:02ForestColl benefits
related talks
14mEfficient Direct-Connect Topologies for Collective Communications
14mAccelerating PyTorch FSDP Via Overlapping Collectives With In...
16mAccelerating Distributed Graph Learning by Using Collaborative In-Network...
21mTransparent and Flexible Network Management for Big Data Processing in the Cloud
17mTopoOpt: Co-optimizing Network Topology and Parallelization Strategy for Distributed...
16mFlow Scheduling with Imprecise Knowledge
16mHeteroSketch: Coordinating Network-wide Monitoring in Heterogeneous and Dynamic Networks
16mTowards Optimal Rack-scale μs-level CPU Scheduling through In-Network Workload...
