A Switch-Centric In-Network Architecture for Accelerating LLM Inference in Shared-Memory Network
Not on the map. Why?
Abstract (arXiv)
Tensor parallelism (TP) has become a key technique for latency-sensitive LLM inference, but it introduces frequent, tightly synchronized All-Reduce operations that lie directly on the inference critical path, making inter-GPU communication a major performance bottleneck. In-network computing offers a promising approach to mitigating this bottleneck. However, we observe that the existing solution, NVLink SHARP (NVLS), is fundamentally constrained by its GPU-driven execution model that exposes in-network computing as GPU-issued, element-granular memory operations rather than a switch-orchestrated collective. This design forces redundant switch-GPU-switch data movement and cannot perform scale-aware quantized All-Reduce due to its lack of cross-element coordination. To address these limitations, we propose SCIN, the first switch-centric in-network computing architecture for multi-accelerator shared-memory networks. SCIN replaces GPU-driven collective orchestration with an in-switch accelerator (ISA) that directly initiates memory transactions and orchestrates the complete All-Reduce operation. This switch-driven execution eliminates redundant data movement inherent in NVLS, shortens synchronization paths, and fully offloads collective execution from GPUs. Furthermore, centralized ISA control enables cross-element coordination between quantized data and their scale factors. SCIN exploits this capability through a pipelined dequantization-reduction-requantization datapath, enabling scale-aware in-network quantized All-Reduce and nearly halving communication volume with negligible accuracy degradation. We implement SCIN on a multi-FPGA prototype to validate its feasibility. For a simulated 8-GPU system, SCIN accelerates small- and large-message All-Reduce by up to 1.8x and 2.6x over NVLS, respectively, translating into up to 1.12x TPOT and 1.42x TTFT speedups.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 89 references that are in the map. First posted on arXiv 30 Mar 2026.
Builds on
28 of 89 references.
References · 28
- 2017Attention Is All You Needcited by 60,361
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
- 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
- 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Servecited by 526
- 2022DeepSpeed Inference: Enabling Efficient Inference of Transformer Models at Unprecedented Scalecited by 407
16 more
- 2019MLPerf Inference Benchmarkcited by 199
- 2024Vidur: A Large-Scale Simulation Framework For LLM Inferencecited by 117
- 2024NanoFlow: Towards Optimal Large Language Model Serving Throughputcited by 90
- 2023LLM-FP4: 4-Bit Floating-Point Quantized Transformerscited by 69
- 2019Scaling Distributed Machine Learning with In-Network Aggregationcited by 65
- 2023ZeRO++: Extremely Efficient Collective Communication for Giant Model Trainingcited by 52
- 2024Mirage: A Multi-Level Superoptimizer for Tensor Programscited by 41
- 2024Context Parallelism for Scalable Million-Token Inferencecited by 26
- 2024Exploring the Trade-Offs: Quantization Methods, Task Difficulty, and Model Size in Large Language Models From Edge to Giantcited by 14
- 2025TokenWeave: Efficient Compute-Communication Overlap for Distributed LLM Inferencecited by 14
- 2024Flash Communication: Reducing Tensor Parallelization Bottleneck for Fast Large Language Model Inferencecited by 11
- 2025Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guaranteescited by 11
- 2026Challenges and Research Directions for Large Language Model Inference Hardwarecited by 11
- 2021Flare: Flexible In-Network Allreducecited by 9
- 2024Communication Compression for Tensor Parallel LLM Inferencecited by 7
- 2025EQuARX: Efficient Quantized AllReduce in XLA for Distributed Machine Learning Accelerationcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Scaling LLM Inference Beyond Amdahl`s Limits via Eliminating Non-Scalable Overheads ↗
- 2025Shift Parallelism: Low-Latency, High-Throughput LLM Inference for Dynamic Workloads
- 2026Characterizing Parallelism Strategies in LLM Inference: Fundamental Compute-Communication Trade-offs
- 2026PipeMax: Enhancing Offline LLM Inference on Commodity GPU Servers
- 2025SpecOffload: Unlocking Latent GPU Capacity for LLM Inference on Resource-Constrained Devices
- 2026LLMVisor: A Real-Time Latency Attribution Model for Multi-Tenant LLM Serving
- 2024NEO: Saving GPU Memory Crisis with CPU Offloading for Online LLM Inference
- 2024KVDirect: Distributed Disaggregated LLM Inference