SwiftQK: Fast and Communication-Efficient Tensor Parallelism for Query-Key Normalization
Gyudong Kim, Wonjun Han, Young Geun Kim
Korea University
cs.LG, cs.DC
Submitted: 2026-08-10
Updated: 2026-08-12
Code: https://github.com/vllm-project/vllm
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 85/100
The gist: SwiftQK is a communication-efficient multi-GPU RMSNorm kernel for layerwise QK-Normalization under Tensor Parallelism (TP).
Terminology
Summary
SwiftQK is a communication-efficient multi-GPU RMSNorm kernel for layerwise QK-Normalization under Tensor Parallelism (TP). It replaces full-vector activation exchange with scalar partial-sum aggregation and overlaps Peer-to-Peer reduction with independent element-wise computation, reducing QK-Norm communication without changing normalization semantics. On recent OLMo models, SwiftQK reduces QK-Norm latency by 81.4–93.9% relative to the All-Gather-based QK-Norm. In end-to-end serving, SwiftQK reduces TPOT on average by 29.5% over All-Gather-based QK-Norm and by 14.3% over an optimized scalar-aggregation implementation.
Improvements for AI systems
Improvements to AI Systems:
-
Reduced Inference Latency in Multi-GPU LLM Serving – By integrating SwiftQK into Tensor Parallelism pipelines, AI systems can achieve up to 29.5% lower Time-Per-Output-Token (TPOT) during real-time generation, enabling faster interactive responses in large-scale deployed models.
-
Scalable Training and Fine-Tuning on Larger Contexts – The communication-efficient RMSNorm kernel allows AI systems to train or fine-tune models with significantly longer sequences (e.g., 128k+ tokens) on the same GPU cluster, because QK-Norm synchronization overhead no longer scales linearly with sequence length.
-
Higher Throughput for Batch Inference – With an 81.4–93.9% reduction in QK-Norm latency, AI systems can process more concurrent requests per second on fixed hardware, improving cost-efficiency for cloud-based LLM APIs.
-
Improved Numerical Stability with No Semantic Change – Since SwiftQK preserves exact normalization semantics (scalar partial-sum aggregation), AI systems can adopt it without retraining or altering model weights, ensuring backward compatibility and avoiding accuracy degradation.
-
Enhanced Memory Bandwidth Utilization – By overlapping Peer-to-Peer reduction with element-wise computation, AI systems can better utilize GPU memory bandwidth, reducing idle time and improving overall hardware efficiency during multi-GPU operations.
-
Support for Larger Model Parallelism – The reduced communication volume enables AI systems to scale to more GPUs (e.g., 8→32) for a given model size, allowing deployment of trillion-parameter models that would otherwise be bottlenecked by QK-Norm communication.
What the Improved AI System Can Do:
-
Serve LLMs with near-linear speedup across GPUs, achieving sub-100ms TPOT for 70B+ parameter models on commodity clusters.
-
Train and fine-tune models with 10x longer context windows without increasing communication overhead.
-
Handle 3–4x higher request throughput in production serving, reducing per-query cost.
-
Seamlessly upgrade existing TP-based inference stacks with a drop-in kernel replacement, requiring no model changes or accuracy loss.
Abstract
Query-Key Normalization (QK-Norm) improves the training stability and quality of modern Large Language Models (LLMs). However, under Tensor Parallelism (TP), layerwise QK-Norm introduces additional cross-GPU communication because the normalization factor depends on the full hidden vector. We present SwiftQK, a multi-GPU RMSNorm kernel that exchanges only scalar normalization statistics and overlaps the remaining Peer-to-Peer reduction with independent element-wise computation in a deadlock-safe persistent kernel. Evaluations on recent LLMs show that SwiftQK reduces QK-Norm latency by 81.4--93.9% relative to the standard TP QK-Norm using full-vector All-Gather. In end-to-end serving, SwiftQK reduces TPOT on average by 29.5% over the All-Gather-based baseline and by 14.3% over an optimized scalar-aggregation implementation.
Sources
- Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism
- FLUX: Fast Software-based Communication Overlap On GPUs Through Kernel Fusion
- 2 OLMo 2 Furious
- Olmo 3
- SimpleGPT: Improving GPT via A Simple Normalization Strategy
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks