QUICK: Quantization-aware Interleaving and Conflict-free Kernel for efficient LLM inference
Taesu Kim, Jongho Lee, Daehyun Ahn, Sarang Kim, Jiwoong Choi, Minkyu Kim, Hyungjun Kim
TL;DR
The paper addresses inefficiencies in weight-only quantized LLM inference caused by dequantization overhead and shared-memory bank conflicts in mixed-precision GEMMs. It proposes QUICK, a set of optimized CUDA kernels that offline interleave quantized weights to align with Tensor Core data-loading patterns (ldmatrix/mma) and skip shared-memory write-backs, thereby removing bank conflicts. Empirical results show substantial gains in matrix-multiply throughput and end-to-end token generation across several models and GPUs, including notable improvements over AutoAWQ and positive benefits in vLLM integration. This approach enables more effective deployment of weight-only quantized LLMs, especially for larger batch sizes, by improving throughput without increasing memory bandwidth requirements.
Abstract
We introduce QUICK, a group of novel optimized CUDA kernels for the efficient inference of quantized Large Language Models (LLMs). QUICK addresses the shared memory bank-conflict problem of state-of-the-art mixed precision matrix multiplication kernels. Our method interleaves the quantized weight matrices of LLMs offline to skip the shared memory write-back after the dequantization. We demonstrate up to 1.91x speedup over existing kernels of AutoAWQ on larger batches and up to 1.94x throughput gain on representative LLM models on various NVIDIA GPU devices.
