SwiftQK: Fast and Communication-Efficient Tensor Parallelism for Query-Key Normalization

arXiv:2608.09160 · cs.LG, cs.DC · Submitted 2026-08-10 · Read on arXiv

Gyudong Kim, Wonjun Han, Young Geun Kim

Korea University

cs.LG, cs.DC

Submitted: 2026-08-10

Updated: 2026-08-12

DOI: 10.1109/LCA.2026.3720688

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:

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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

Related papers