RequestRouter: Request-Boundary Routing for Efficient Single-GPU LLM Inference
On the map: Efficient LLM inference and serving → Serving systems and request scheduling
Abstract (arXiv)
RequestRouter is a lightweight request-boundary controller for reducing the latency and energy cost of single-GPU large language model inference. Rather than serving all requests with one static configuration, the system uses cheap request-level features to select one fixed inference mode per request, including FP16, quantized inference, speculative decoding, prefix caching, continuous batching, and hybrid modes such as GPTQ plus prefix caching and INT8 plus continuous batching. We evaluate RequestRouter using an 8B instruction-tuned language model served through vLLM on NVIDIA A100 GPUs. Across the full-scale A100 evaluation--26,500 fixed-mode evaluations followed by 3,500 online-controller evaluations, for 30,000 measured inference executions in total--the controller achieves a 2.10x mean latency speedup over FP16 and a 0.48x energy ratio on deployment-style workloads. A smaller matched evaluation with repeated measurements provides a controlled statistical check of this result: RequestRouter retains a 1.93x latency speedup (95% CI: 1.88--1.98x) and a 0.523 energy ratio (95% CI: 0.506--0.540), showing that the gains persist under a more tightly controlled protocol. On a separate expanded automatic benchmark evaluation, the routed policy retains 99.6% of FP16 macro accuracy. A 100,000-call CPU microbenchmark measures only 0.00475 ms mean routing overhead (0.00532 ms p99). Thus, simple request-aware routing can recover substantial serving efficiency without retraining or modifying the underlying LLM.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 11 of its 17 references that are in the map. First posted on arXiv 21 May 2026.
Builds on
11 of 17 references.
Closest ancestors · 1
Same direction, newest first
Other references · 10
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
- 2023Power Hungry Processing: Watts Driving the Cost of AI Deployment?cited by 191
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Lodestar: An Online-Learning LLM Inference Router
- 2024NEO: Saving GPU Memory Crisis with CPU Offloading for Online LLM Inference
- 2024AQUA: Network-Accelerated Memory Offloading for LLMs in Scale-Up GPU Domains
- 2026Characterization of Request and Token Energy Costs for LLM Inference Workloads on GPU Platforms
- 2026The 1/W Law: An Analytical Study of Context-Length Routing Topology and GPU Generation Gains for LLM Inference Energy Efficiency
- 2026Calibrate, Then Route: A Measured Study of Learned Request Routing for Disaggregated LLM Serving
- 2026KernelSight-LM: A Kernel-Level LLM Inference Simulator
- 2026FleetOpt: Analytical Fleet Provisioning for LLM Inference with Compress-and-Route as Implementation Mechanism