paper-with-me

Papers

TACCL: Guiding Collective Algorithm Synthesis using Communication Sketches

2021-11-08 · Aashaka Shah, Vijay Chidambaram, Meghan Cowan, Saeed Maleki, Madan Musuvathi, Todd Mytkowicz, Jacob Nelson, Olli Saarikivi, Rachee Singh

Machine learning models are increasingly being trained across multiple GPUs and servers. In this setting, data is transferred between GPUs using communication collectives such as AlltoAll and AllReduce, which can become a significant bottleneck in training large models. Thus, it is important to use efficient algorithms for collective communication. We develop TACCL, a tool that enables algorithm designers to guide a synthesizer into automatically generating algorithms for a given hardware configuration and communication collective. TACCL uses a novel communication sketch abstraction to get crucial information from the designer to significantly reduce the search space and guide the synthesizer towards better algorithms. TACCL also uses a novel encoding of the problem that allows it to scale beyond single-node topologies. We use TACCL to synthesize algorithms for three collectives and two hardware topologies: DGX-2 and NDv2. We demonstrate that the algorithms synthesized by TACCL outperform the Nvidia Collective Communication Library (NCCL) by up to 6.7x. We also show that TACCL can speed up end-to-end training of Transformer-XL and BERT models by 11%--2.3x for different batch sizes.

📄 PDF Abstract BibTeX arXiv:2111.04867

Code (2)

microsoft/msccl 공식 구현 pytorch
microsoft/taccl 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Adaptive Softmax Adaptive Softmax is a speedup technique for the computation of probability distributions over words. The adaptive softmax is…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Variational Dropout Variational Dropout is a regularization technique based on dropout, but uses a variational inference grounded approach. In…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.

Similar Papers 제목 키워드 기반

TACOS: Topology-Aware Collective Algorithm Synthesizer for Distributed Machine Learning

2023-04-11 · William Won, Midhilesh Elavazhagan, Sudarshan Srinivasan, Swati Gupta 외

The surge of artificial intelligence, particularly large language models, has driven the rapid development of large-scale machine learning clusters. Executing distributed models on these clusters is often constrained by …

Software Engineering for Collective Cyber-Physical Ecosystems

2024-06-07 · Roberto Casadei, Gianluca Aguzzi, Giorgio Audrito, Ferruccio Damiani 외

Today's distributed and pervasive computing addresses large-scale cyber-physical ecosystems, characterised by dense and large networks of devices capable of computation, communication and interaction with the environment…

Enabling Reconfiguration-Communication Overlap for Collective Communication in Optical Networks

2025-10-22 · Changbo Wu, Zhuolong Yu, Gongming Zhao, Hongli Xu arxiv

Collective communication (CC) is critical for scaling distributed machine learning (DML). The predictable traffic patterns of DML present a great opportunity for applying optical network technologies. Optical networks wi…

Bine Trees: Enhancing Collective Operations by Optimizing Communication Locality

2025-08-24 · Daniele De Sensi, Saverio Pasqualoni, Lorenzo Piarulli, Tommaso Bonato 외 arxiv

Communication 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 thr…

Strategic Coordination for Evolving Multi-agent Systems: A Hierarchical Reinforcement and Collective Learning Approach

2025-09-22 · Chuhao Qin, Evangelos Pournaras arxiv

Decentralized combinatorial optimization in evolving multi-agent systems poses significant challenges, requiring agents to balance long-term decision-making, short-term optimized collective outcomes, while preserving aut…

Multi-agent Reinforcement Learning