mlsanityData to 14 Oct 2026

ForestColl: Throughput-Optimal Collective Communications on Heterogeneous Network Fabrics

arXiv 2402.06787 ↗First posted 9 Feb 2024cs.NI cs.DC cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

As modern DNN models grow ever larger, collective communications between the accelerators (allreduce, etc.) emerge as a significant performance bottleneck. Designing efficient communication schedules is challenging, given today's heterogeneous and diverse network fabrics. We present ForestColl, a tool that generates throughput-optimal schedules for any network topology. ForestColl constructs broadcast/aggregation spanning trees as the communication schedule, achieving theoretical optimality. Its schedule generation runs in polynomial time and is highly scalable. ForestColl supports any network fabric, including both switching fabrics and direct accelerator connections. We evaluated ForestColl on AMD MI250 and NVIDIA DGX A100 & H100 clusters. ForestColl showed significant improvements over the vendors' own optimized communication libraries across various settings and in LLM training. ForestColl also outperformed other state-of-the-art schedule generation techniques with both more efficient generated schedules and substantially faster generation speed.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 74 references that are in the map. First posted on arXiv 9 Feb 2024.

Builds on

22 of 74 references.

References · 22

  1. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  2. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  3. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  4. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
  5. 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 660
  6. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
  7. 2022Efficiently Scaling Transformer Inferencecited by 539
  8. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 279
  9. 2018Beyond Data and Model Parallelism for Deep Neural Networkscited by 179
  10. 2019Scaling Distributed Machine Learning with In-Network Aggregationcited by 65
  11. 2021Breaking the Computation and Communication Abstraction Barrier in Distributed Machine Learning Workloadscited by 40
  12. 2021TACCL: Guiding Collective Algorithm Synthesis using Communication Sketchescited by 38
10 more
  1. 2019Blink: Fast and Generic Collectives for Distributed MLcited by 36
  2. 2020Synthesizing Optimal Collective Algorithmscited by 30
  3. 2022TopoOpt: Co-optimizing Network Topology and Parallelization Strategy for Distributed Training Jobscited by 30
  4. 2023CASSINI: Network-Aware Job Scheduling in Machine Learning Clusterscited by 26
  5. 2024T3: Transparent Tracking & Triggering for Fine-grained Overlap of Compute & Collectivescited by 16
  6. 2023Rail-only: A Low-Cost High-Performance Network for Training LLMs with Trillion Parameterscited by 13
  7. 2023Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow Problemcited by 11
  8. 2021Flare: Flexible In-Network Allreducecited by 9
  9. 2019JGraphT -- A Java library for graph data structures and algorithmscited by 5
  10. 2022Efficient Direct-Connect Topologies for Collective Communicationscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.