Canvas: Scalable Collective Communication Scheduling for Large-Scale GPU Clusters
State-of-the-art deep learning models rely on large GPU clusters and various parallelism strategies, which in turn depend on collective communication (CC) operators to synchronize data. While vendor libraries (e.g., NCCL, RCCL) provide standard CC algorithms, they often suffer from bandwidth bottlenecks in imbalanced topologies. Recent synthesis-based methods improve performance but face three key limitations: poor scalability due to the combinatorial explosion of scheduling space, lack of support for multistage execution, and suboptimal communication throughput. We propose Canvas, a scalable and near-optimal CC scheduling framework that addresses these challenges. Canvas introduces: (1) Hierarchical synthesis to decompose the global scheduling problem into tractable subproblems for scalability. (2) Collective decomposition to enable structured, multi-stage algorithm generation. (3) Cross-micro-batch pipeline scheduling to parallelize communication across micro-batches and maximize link utilization. Evaluations show that Canvas achieves up to 1.98× bandwidth speedup over TACCL and 3.56× over TE-CCL, and synthesizes algorithms for 512-GPU topologies within 1.77 hours, whereas TACCL fails to produce results within 24 hours.
Authors
- Xiuzhu Sha
- Yi Zhao (ORCID: https://orcid.org/0000-0001-5368-3595)
- Fuliang Li (ORCID: https://orcid.org/0000-0001-9782-0053)
- Chenyang Hei (ORCID: https://orcid.org/0000-0001-5010-1529)
- Chengxi Gao (ORCID: https://orcid.org/0000-0003-1386-7394)
- Xingwei Wang
- Tongrui Liu
Institutions
- Shenzhen Institutes of Advanced Technology (CN)
- Northeastern University (CN)
Publication Details
- Published
- 2025-09-22
- DOI
- https://doi.org/10.1109/icnp65844.2025.11192367
- Primary Topic
- Modular Robots and Swarm Intelligence
- Type
- article
- Field-Weighted Citation Impact
- 0.00