Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dingtian Yan

dblp:206/5827 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0004-3112-8215ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 62% Memory systems · 38%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
inference serving
1.012026
TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Scheduling · EuroSys 2026
Cloud and datacenter computing › inference serving
LLM serving
1.012026
TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Scheduling · EuroSys 2026
Memory systems
cache management
0.312026
TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Scheduling · EuroSys 2026
Memory systems › cache management
KV cache management
0.312026
TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Scheduling · EuroSys 2026

Methods — techniques the papers use, named apart from their topics

preemptive scheduling · 2.0KV cache offloading · 2.0
YearPublicationVenuePosition
2026 TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Scheduling
abstract
Real-time LLM interactions demand streamed token generations, where text tokens are progressively generated and delivered to users while balancing two objectives: responsiveness (i.e., low time-to-first-token) and steady generation (i.e., required time-between-tokens). Standard LLM serving systems suffer from the inflexibility caused by non-preemptive request scheduling and reactive memory management, leading to poor resource utilization and low request processing parallelism under request bursts. Therefore, we present TokenFlow, a novel LLM serving system with enhanced text streaming performance via preemptive request scheduling and proactive key-value (KV) cache management. TokenFlow dynamically prioritizes requests based on real-time token buffer occupancy and token consumption rate, while actively transferring KV cache between GPU and CPU memory in the background and overlapping I/O with computation to minimize request preemption overhead. Extensive experiments on Llama3-8B and Qwen2.5-32B across multiple GPUs (RTX 4090, A6000, H200) demonstrate that TokenFlow achieves up to 82.5% higher effective throughput (accounting for actual user consumption) while reducing P99 TTFT by up to 80.2%, without degrading overall token throughput.
Chuheng Du, Renyuan Liu, Shuochao Yao, Dingtian Yan, Jiang Liao, Shengzhong Liu, Fan Wu 0006, Guihai Chen
EuroSys5