Pith. sign in

REVIEW 1 cited by

FastSwitch: Optimizing Context Switching Efficiency in Fairness-aware Large Language Model Serving

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.18424 v1 pith:L5RUKRNJ submitted 2024-11-27 cs.LG cs.DC

classification cs.LGcs.DC
keywords servingmemorysystemcachecontextexistingfairnessfastswitch
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Serving numerous users and requests concurrently requires good fairness in Large Language Models (LLMs) serving system. This ensures that, at the same cost, the system can meet the Service Level Objectives (SLOs) of more users , such as time to first token (TTFT) and time between tokens (TBT), rather than allowing a few users to experience performance far exceeding the SLOs. To achieve better fairness, the preemption-based scheduling policy dynamically adjusts the priority of each request to maintain balance during runtime. However, existing systems tend to overly prioritize throughput, overlooking the overhead caused by preemption-induced context switching, which is crucial for maintaining fairness through priority adjustments. In this work, we identify three main challenges that result in this overhead. 1) Inadequate I/O utilization. 2) GPU idleness. 3) Unnecessary I/O transmission during multi-turn conversations. Our key insight is that the block-based KV cache memory policy in existing systems, while achieving near-zero memory waste, leads to discontinuity and insufficient granularity in the KV cache memory. To respond, we introduce FastSwitch, a fairness-aware serving system that not only aligns with existing KV cache memory allocation policy but also mitigates context switching overhead. Our evaluation shows that FastSwitch outperforms the state-of-the-art LLM serving system vLLM with speedups of 1.4-11.2x across different tail TTFT and TBT.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SCORPIO: Serving the Right Requests at the Right Time for Heterogeneous SLOs in LLM Inference

    cs.LG 2025-05 reject novelty 5.0 of 10

    SCORPIO combines least-deadline-first reordering, VBS admission control, and credit-based batching to improve SLO attainment in LLM serving, but its evaluation leaks training data into the served workload.

Pith tools