Purlin: Separating Orchestration from the Datapath of Collectives
Not on the map. Why?
Abstract (arXiv)
Distributed inference depends on GPU collective communication that must keep pace with evolving hardware and specialized workloads. However, existing works often couple the semantics, orchestration (where and when data moves), and datapath (how data moves) of collective communication. This coupling makes it costly to adopt new hardware mechanisms and customize communication for applications. We present Purlin, a scale-up communication framework that separates these concerns. At the top of Purlin, we specify collectives as a naming of an input and output layout and a copy or reduction operation. In the middle, we introduce a shared orchestration protocol, Stage, Notify, And Consume (SNAC), which derives coordination from these specifications. Below SNAC sits a hardware-specific datapath we call Atom, which implements two key data movement primitives for collectives: copy and reduce. This separation lets us customize collectives and adopt new hardware mechanisms while reusing orchestration via SNAC. We evaluate Purlin on A100, H200, and B200 GPUs. Across seven collectives, Purlin achieves latency speedups of up to 5.14x and bandwidth improvements of up to 4.50x over baselines. Integrated into SGLang, Purlin improves offline LLM serving throughput and interactivity by 1.13x on average and up to 1.37x over baselines. For online LLM inference, Purlin improves interactivity by 1.26x on average and up to 2.85x, with the largest gain occurring under overload. For diffusion image generation, Purlin reduces end-to-end latency by up to 1.13x.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 58 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
18 of 58 references.
References · 18
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
- 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Servingcited by 617
- 2023Splitwise: Efficient generative LLM inference using phase splittingcited by 558
- 2024LoongServe: Efficiently Serving Long-Context Large Language Models with Elastic Sequence Parallelismcited by 112
- 2021TACCL: Guiding Collective Algorithm Synthesis using Communication Sketchescited by 38
- 2020Synthesizing Optimal Collective Algorithmscited by 30
- 2025Demystifying NCCL: An In-depth Analysis of GPU Communication Protocols and Algorithmscited by 20
- 2025MPK: A Compiler and Runtime for Mega-Kernelizing Tensor Programscited by 15
- 2025FlashMoE: Fast Distributed MoE in a Single Kernelcited by 14
6 more
- 2025ParallelKittens: Systematic and Practical Simplification of Multi-GPU AI Kernelscited by 12
- 2025MSCCL++: Rethinking GPU Communication Abstractions for AI Inferencecited by 10
- 2025An Extensible Software Transport Layer for GPU Networkingcited by 10
- 2026CuTe Layout Representation and Algebracited by 6
- 2026Demystifying NVSHMEM: A System-Level Analysis on Symmetric Memory and Device-Initiated Operations in GPU Communicationcited by 4
- 2026Every Microsecond Matters: Achieving Near Speed-of-Light Latency in GPU Collectivescited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026TENT: A Declarative Slice Spraying Engine for Performant and Resilient Data Movement in Disaggregated LLM Serving
- 2026ChunkFlow: Communication-Aware Chunked Prefetching for Layerwise Offloading in Distributed Diffusion Transformer Inference
- 2026Weave: Fine-Grained Dynamic SM Scheduling in an MoE Megakernel for Compute-Communication Overlap
- 2025DuetServe: Harmonizing Prefill and Decode for LLM Serving via Adaptive GPU Multiplexing
- 2026NCCLZ: Compression-Enabled GPU Collectives with Decoupled Quantization and Entropy Coding
- 2026The 1/W Law: An Analytical Study of Context-Length Routing Topology and GPU Generation Gains for LLM Inference Energy Efficiency
- 2026A Switch-Centric In-Network Architecture for Accelerating LLM Inference in Shared-Memory Network
- 2023Optimizing Distributed ML Communication with Fused Computation-Collective Operations