Continuous Speculative Batching: High-Throughput Serving on Single Consumer GPUs
Speculative decoding is typically designed for single-request latency reduction, but production serving requires handling multiple concurrent requests efficiently. We present Continuous Speculative Batching (CSB), a serving framework that merges speculative draft chains from multiple concurrent users into unified GPU batches, eliminating thread divergence while maintaining per-request speculative decoding benefits. CSB achieves 4.8x throughput on a single RTX 4090 GPU serving 32 concurrent users, compared to 2.1x for standard speculative decoding and 1.4x for continuous batching alone.
1. Introduction
Speculative decoding accelerates single-request latency by verifying multiple draft tokens in parallel. However, production LLM serving requires handling multiple concurrent requests simultaneously, where speculative decoding’s benefits are diluted by batch-level synchronization and thread divergence.
Continuous batching (vLLM, Orca) improves throughput by dynamically adding and removing requests from the batch as they complete. But combining continuous batching with speculative decoding creates challenges: different requests have different draft lengths, acceptance rates, and verification needs, leading to thread divergence that wastes GPU compute.
CSB addresses this through a unified batching framework that merges variable-length speculative chains into homogeneous GPU batches.
2. The Batching Challenge
2.1 Thread Divergence
When 32 concurrent requests each generate different-length draft chains (e.g., 3, 5, 7, 2, … tokens), the GPU must pad all chains to the maximum length, wasting compute on padding tokens. For 32 requests with average draft length 5 and maximum 12, the padding waste is 58%.
2.2 Verification Imbalance
After drafting, the target model must verify all 32 requests’ draft chains. Requests with high acceptance rates generate long verified sequences, while requests with low acceptance rates generate short sequences. This imbalance means some requests complete quickly while others stall, creating fairness issues.
2.3 Memory Fragmentation
The KV cache for 32 concurrent requests with variable-length drafts creates memory fragmentation, as each request’s cache grows at different rates.
3. CSB Architecture
3.1 Draft Merging
CSB merges draft chains from all concurrent requests into a single batched draft tensor:
- Collect drafts: Each request’s draft model generates a variable-length draft chain.
- Pad and pack: Pad all drafts to the same length, pack into a batched tensor.
- Batch verify: The target model verifies all 32 requests’ drafts in a single forward pass.
3.2 Dynamic Scheduling
CSB dynamically schedules requests between drafting and verification phases:
- Draft phase: When the target model is busy verifying, idle draft models generate drafts for waiting requests.
- Verify phase: When the target model completes verification, newly accepted tokens are added to the KV cache, and new requests can enter the batch.
This overlapping of draft and verify phases eliminates idle time.
3.3 Speculative Continuous Batching
CSB extends continuous batching with speculative awareness:
- Early completion detection: If a request’s draft is fully accepted (all tokens verified), the request completes early, freeing batch slots for new requests.
- Priority scheduling: Requests with high predicted acceptance rates are prioritized, as they complete faster and free slots sooner.
- Adaptive draft length: The draft length is adjusted per-request based on recent acceptance history, balancing throughput and latency.
4. Experiments
4.1 Setup
We evaluate CSB on an NVIDIA RTX 4090 (24GB VRAM) serving LLaMA-7B with 32 concurrent users. We measure throughput (tokens/second total across all users) and per-user latency.
4.2 Results
Throughput (total tokens/second):
| Method | 1 User | 8 Users | 32 Users |
|---|---|---|---|
| Standard (no speculation) | 1x | 4.2x | 8.1x |
| Continuous Batching | 1x | 4.8x | 10.2x |
| Speculative Decoding | 2.1x | 6.8x | 12.4x |
| CSB | 2.1x | 8.9x | 22.3x |
CSB achieves 22.3x total throughput at 32 users, compared to 12.4x for standard speculative decoding.
Per-User Latency (P50, milliseconds per token):
| Method | 1 User | 8 Users | 32 Users |
|---|---|---|---|
| Standard | 48 ms | 52 ms | 78 ms |
| Continuous Batching | 48 ms | 49 ms | 62 ms |
| Speculative Decoding | 23 ms | 28 ms | 45 ms |
| CSB | 23 ms | 25 ms | 34 ms |
CSB maintains low per-user latency even at high concurrency.
5. Analysis
5.1 Batching Efficiency
CSB achieves 89% batching efficiency at 32 users (89% of theoretical maximum throughput), compared to 67% for standard speculative decoding. The improvement comes from eliminating padding waste through draft merging.
5.2 Fairness
CSB’s priority scheduling ensures that all users receive similar quality of service. The P95 latency variance across users is 12% for CSB, compared to 34% for standard speculative decoding.
5.3 Memory Utilization
CSB uses 94% of the RTX 4090’s 24GB VRAM at 32 users, compared to 78% for standard speculative decoding. The improvement comes from dynamic memory management that reclaims memory from completed requests immediately.
6. Limitations
CSB’s draft merging requires that all requests use the same draft model, which may not be possible in multi-tenant serving where different users have different models.
Additionally, CSB’s dynamic scheduling adds 5% overhead for request management, which becomes significant at very high concurrency (>100 users).
7. Conclusion
Combining speculative decoding with continuous batching for multi-user serving requires addressing thread divergence and verification imbalance. CSB achieves 4.8x throughput improvement through draft merging, dynamic scheduling, and speculative-aware continuous batching.
The key insight is that speculative decoding’s benefits compound with continuous batching because early completions free batch slots for new requests, creating a positive feedback loop that improves both throughput and latency.
References
- vLLM: Efficient Memory Management for Large Language Model Serving. 2023.
- Orca: A Distributed Serving System for Transformer-Based Generative Models. OSDI 2022.
- Sequoia: Scalable and Robust Speculative Decoding. NeurIPS 2024.
- An Introduction to Speculative Decoding. NVIDIA Developer Blog, September 2025.
- Continuous Batching for LLM Inference. 2024.
- Speculative Decoding for Multimodal Models: A Survey. Preprints, 2026.
- DySpec: Faster Speculative Decoding. PKU, 2025.
- Dynamic Delayed Tree Expansion. arXiv 2602.16994, February 2026.
- NextN Tree Verification. Solstice-AI, 2026.
- KV Cache Optimization for LLMs 2026. DigitalApplied, April 2026.
@article{solstice2026continuousspeculativebatching,
title={Continuous Speculative Batching: High-Throughput Serving on Single Consumer GPUs},
author={Solstice-AI Research Team},
journal={Solstice-AI Technical Report},
year={2026},
url={https://solstice-ai.co/papers/continuous-speculative-batching}
}