Multicast time-expanded graph-based collective communication scheduling algorithm
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Collective communication latency has become a major performance bottleneck in large-scale distributed training. To address the limitations of existing algorithms in terms of insufficient topology awareness and high computational complexity, a topology-aware collective communication scheduling algorithm based on multicast time-expanded graph was proposed. By constructing a multicast time-varying graph model, both network topology constraints and time-slot conflict constraints were explicitly captured. The collective communication scheduling problem was then transformed into a multicast path search problem on the time-varying graph, enabling joint optimization of routing and time slot planning. Simulation results demonstrate that the proposed algorithm achieves near-optimal communication completion time while significantly reducing computational complexity, making it suitable for large-scale distributed training scenarios.
Fields of Study & Subjects
Network Traffic and Congestion Control
Parallel Computing and Optimization Techniques
Interconnection Networks and Systems
Publication details
- Journal / source
- DOAJ (DOAJ: Directory of Open Access Journals)
- Publication date
- 1 January 2026
- Language
- ZH