MSCCL++: Rethinking GPU Communication Abstractions for AI Inference
Not on the map. Why?
Abstract (arXiv)
AI applications increasingly run on fast-evolving, heterogeneous hardware to maximize performance, but general-purpose libraries lag in supporting these features. Performance-minded programmers often build custom communication stacks that are fast but error-prone and non-portable. This paper introduces MSCCL++, a design methodology for developing high-performance, portable communication kernels. It provides (1) a low-level, performance-preserving primitive interface that exposes minimal hardware abstractions while hiding the complexities of synchronization and consistency, (2) a higher-level DSL for application developers to implement workload-specific communication algorithms, and (3) a library of efficient algorithms implementing the standard collective API, enabling adoption by users with minimal expertise. Compared to state-of-the-art baselines, MSCCL++ achieves geomean speedups of 1.7× (up to 5.4×) for collective communication and 1.2× (up to 1.38×) for AI inference workloads. MSCCL++ is in production of multiple AI services provided by Microsoft Azure, and has also been adopted by RCCL, the GPU collective communication library maintained by AMD. MSCCL++ is open source and available at https://github.com/microsoft/mscclpp . Our two years of experience with MSCCL++ suggests that its abstractions are robust, enabling support for new hardware features, such as multimem, within weeks of development.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 9 of its 31 references that are in the map. First posted on arXiv 11 Apr 2025.
Builds on
9 of 31 references.
References · 9
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2023Splitwise: Efficient generative LLM inference using phase splittingcited by 536
- 2022Tutel: Adaptive Mixture-of-Experts at Scalecited by 199
- 2021Breaking the Computation and Communication Abstraction Barrier in Distributed Machine Learning Workloadscited by 40
- 2021TACCL: Guiding Collective Algorithm Synthesis using Communication Sketchescited by 38
- 2020Synthesizing Optimal Collective Algorithmscited by 30
- 2024BLITZSCALE: Fast and Live Large Model Autoscaling with O(1) Host Cachingcited by 23
- 2023Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow Problemcited by 11
Built on by
Citing papers per year: 2026: 9.
9 papers.
- 2026Kareus: Joint Reduction of Dynamic and Static Energy in Large Model Trainingcited by 3
- 2026GF-DiT: Scheduling Parallelism for Diffusion Transformer Servingcited by 1
- 2026NanoCP: Request-Level Dynamic Context Parallelism for Data-Expert Parallel Decodingcited by 0
- 2026UBEP: Re-architecting Expert Parallelism Communication Library for Production Superpodscited by 0
- 2026Maia 200: A Software Defined Dataflow System for Large-scale AI Accelerationcited by 0
- 2026mKernel: Fast Multi-GPU, Multi-Node Fused Kernelscited by 0
- 2026The Life of a Token: from Words to Bits on the Wirecited by 0
- 2026Purlin: Separating Orchestration from the Datapath of Collectivescited by 0
- 2026Efficient Expert-Parallel Communication on PCIe-Connected Consumer GPUscited by 0
- 2026Efficient Expert-Parallel Communication on PCIe-Connected Consumer GPUs30 Sep 2026
- 2026Purlin: Separating Orchestration from the Datapath of Collectives29 Sep 2026
- 2026The Life of a Token: from Words to Bits on the Wire17 Sep 2026
- 2026mKernel: Fast Multi-GPU, Multi-Node Fused Kernels11 Sep 2026
- 2026Maia 200: A Software Defined Dataflow System for Large-scale AI Acceleration25 Aug 2026
- 2026UBEP: Re-architecting Expert Parallelism Communication Library for Production Superpods7 Jul 2026
- 2026GF-DiT: Scheduling Parallelism for Diffusion Transformer Serving11 Jun 2026
- 2026NanoCP: Request-Level Dynamic Context Parallelism for Data-Expert Parallel Decoding20 May 2026
- 2026Kareus: Joint Reduction of Dynamic and Static Energy in Large Model Training25 Jan 2026