A follow-up turn that waits for admission holds no reference on its cached prefix. With a prefix unit finer than the block, its whole hit depends on every one of those blocks: the resume key sits in the top attention block, and the only GDN state is the held tail. So the first of them that another request's allocation popped from the free queue turned the next turn into a cold prefill; that was usually its own top block, which is freed first. Under a long-context multi-turn agent load (8 conversations, 80-100K-token prompts) this gave 4-5 total misses per 300 s at unit 64/512 and none at unit 4096. All of them happened while the pool was at 88-99 % with one or two conversations waiting, and the conversation that missed was usually the next victim too. Now the manager can pin a waiter's hit: - pin_waiting_hit looks the request up and takes a ref on every non-null hit block in every group. It also pins the block holding the EAGLE/MTP proof unit: one unit past the key, dropped from the returned hit, and a different block when the key ends a block. The pinned blocks stay out of the free queue. - release_pinned_hit drops a pin; yield_pinned_hits drops the most recently pinned waiters' first. - allocate_slots releases the request's pin when it succeeds (its table holds the hit from then on), free releases it (abort, finish), and reset_prefix_cache yields every pin before resetting. Pinned blocks are referenced, so admission and the watermark see them as used. The scheduler pins the front of the waiting queue after each scheduling pass: arrival order, at most MAX_PINNED_WAITERS = 8, only requests that have not computed anything yet, never with a KV connector. It does this also while the running set is full, when a waiter is not even looked up. A pin never costs anyone blocks. A running request that fails to allocate yields one waiter's pin and retries before any preemption victim is chosen. A head-of-line waiter whose admission fails yields the pins of the waiters behind it and retries once. When pins are active the scheduler logs one startup line saying so, with the bound, the hash unit and the block size. On a closed-loop CPU model of that load (6-8 conversations, 1-2 waiting, pool 88-100 %), total misses went from 3/1/1/5 to 2/0/0/0 with every waiter pinned. The remaining two sit at 99.2 % use, where the running set needed the pinned blocks themselves (two yields, 65 blocks). Unit 4096 is unaffected except where a waiter was losing its boundary block. Tests: - A pinned waiter survives another follow-up's admission and a burst, and resumes at its tail (a total miss without the pin). - Pool full and a running request needs a block: the pin yields, nobody is preempted, and the waiter is still admitted later. - Pins are released on abort, admission, yield and reset without leaks; the bound is respected; yield order is newest first. - The scheduler's pass pins in arrival order up to the bound and skips partly computed requests and connector setups. Co-Authored-By: Hinata <hinata@idihore.id> Signed-off-by: MOVZX <movzx@yahoo.com>
Easy, fast, and cheap LLM serving for everyone
| Documentation | Blog | Paper | Twitter/X | User Forum | Developer Slack |
🔥 We have built a vLLM website to help you get started with vLLM. Please visit vllm.ai to learn more. For events, please visit vllm.ai/events to join us.
About
vLLM is a fast and easy-to-use library for LLM inference and serving.
Originally developed in the Sky Computing Lab at UC Berkeley, vLLM has grown into one of the most active open-source AI projects built and maintained by a diverse community of many dozens of academic institutions and companies from over 2000 contributors.
vLLM is fast with:
- State-of-the-art serving throughput
- Efficient management of attention key and value memory with PagedAttention
- Continuous batching of incoming requests, chunked prefill, prefix caching
- Fast and flexible model execution with piecewise and full CUDA/HIP graphs
- Quantization: FP8, MXFP8/MXFP4, NVFP4, INT8, INT4, GPTQ/AWQ, GGUF, compressed-tensors, ModelOpt, TorchAO, and more
- Optimized attention kernels including FlashAttention, FlashInfer, TRTLLM-GEN, FlashMLA, and Triton
- Optimized GEMM/MoE kernels for various precisions using CUTLASS, TRTLLM-GEN, CuTeDSL
- Speculative decoding including n-gram, suffix, EAGLE, DFlash
- Automatic kernel generation and graph-level transformations using torch.compile
- Disaggregated prefill, decode, and encode
vLLM is flexible and easy to use with:
- Seamless integration with popular Hugging Face models
- High-throughput serving with various decoding algorithms, including parallel sampling, beam search, and more
- Tensor, pipeline, data, expert, and context parallelism for distributed inference
- Streaming outputs
- Generation of structured outputs using xgrammar or guidance
- Tool calling and reasoning parsers
- OpenAI-compatible API server, plus Anthropic Messages API and gRPC support
- Efficient multi-LoRA support for dense and MoE layers
- Support for NVIDIA GPUs, AMD GPUs, Intel GPUs, and x86/ARM/PowerPC CPUs. Additionally, diverse hardware plugins such as Google TPUs, Intel Gaudi, IBM Spyre, Huawei Ascend, Rebellions NPU, Apple Silicon, MetaX GPU, and more.
vLLM seamlessly supports 200+ model architectures on Hugging Face, including:
- Decoder-only LLMs (e.g., Llama, Qwen, Gemma)
- Mixture-of-Expert LLMs (e.g., Mixtral, DeepSeek-V3, Qwen-MoE, GPT-OSS)
- Hybrid attention and state-space models (e.g., Mamba, Qwen3.5)
- Multi-modal models (e.g., LLaVA, Qwen-VL, Pixtral)
- Embedding and retrieval models (e.g., E5-Mistral, GTE, ColBERT)
- Reward and classification models (e.g., Qwen-Math)
Find the full list of supported models here.
Getting Started
Install vLLM with uv (recommended) or pip:
uv pip install vllm
Or build from source for development.
Visit our documentation to learn more.
Contributing
We welcome and value any contributions and collaborations. Please check out Contributing to vLLM for how to get involved.
Citation
If you use vLLM for your research, please cite our paper:
@inproceedings{kwon2023efficient,
title={Efficient Memory Management for Large Language Model Serving with PagedAttention},
author={Woosuk Kwon and Zhuohan Li and Siyuan Zhuang and Ying Sheng and Lianmin Zheng and Cody Hao Yu and Joseph E. Gonzalez and Hao Zhang and Ion Stoica},
booktitle={Proceedings of the ACM SIGOPS 29th Symposium on Operating Systems Principles},
year={2023}
}
Contact Us
- For technical questions and feature requests, please use GitHub Issues
- For discussing with fellow users, please use the vLLM Forum
- For coordinating contributions and development, please use Slack
- For security disclosures, please use GitHub's Security Advisories feature
- For collaborations and partnerships, please contact us at collaboration@vllm.ai
Media Kit
- If you wish to use vLLM's logo, please refer to our media kit repo
