Caching and configuration settings impact large language model serving speed

A Controlled Experimental Evaluation of Configuration and Cache Architecture in LLM Serving Engines

Distributed, Parallel, and Cluster ComputingMachine LearningPerformance

Summary

Large language models often receive many requests that start with the same words, so servers try to reuse stored data to respond faster. This paper compares two such servers, called vLLM and SGLang, to see if differences in their settings or caching cause speed differences. The authors controlled for configuration and found that much of vLLM's speed advantage comes from how it manages long prompts in chunks. After matching certain settings, the remaining speed difference comes from how each server handles waiting requests and caching. They offer recommendations for fairer comparisons of such servers.

What this means in practice

Authors

Muhammad Faizan Anwar, Sina Keshvadi

Abstract

Multi-agent LLM applications repeat most of their prompt tokens across requests, and serving engines reuse the cached state of shared prefixes. vLLM and SGLang reuse it at different granularities, and benchmarks of their default deployments report large performance gaps, usually credited to the cache. Such comparisons rarely control for other configuration differences. One of them, whether a long prompt is prefilled in chunks, is set by each engine's defaults from the hardware and the release, and it confounds the comparison. We built a reproducible testbed on Kubernetes and a seeded multi-agent workload generator, and compared the two engines under vendor defaults and with chunked prefill matched. SGLang's configuration is the same in both arms, which makes it an internal control across independently provisioned deployments. Under defaults, vLLM's median time to first token is up to 64x SGLang's. Matching one setting removes 78% of the capacity gap where that gap is largest and 30 to 67% of the latency gap. Near saturation the remaining latency gap reflects queue growth. A fluid queue model driven only by a 4.4% throughput shortfall reproduces it, and shows that such a gap scales with the length of the benchmark run. What survives matching is a tail-latency advantage of 2.4 to 6.4x at equal throughput, consistent with cache-aware ordering of waiting requests. We derive six recommendations for comparing serving engines.