Skip to content
#

serving-systems

Here are 10 public repositories matching this topic...

Exploratory AI infrastructure project modeling semantic KV-cache orchestration, memory tiering, and HBM/CXL movement tradeoffs for long-context LLM inference.

  • Updated May 19, 2026
  • Python

Discrete-event simulation benchmark for LLM request cancellation handling, measuring wasted compute, KV residency overhead, and survivor latency recovery across polling and push-based strategies.

  • Updated Jul 25, 2026
  • Python

Discrete-event simulation benchmark for graceful degradation strategies in LLM serving: output capping, CoT disabling, model downgrade, and selective drop under progressive pressure.

  • Updated Jul 26, 2026
  • Python

Analytical benchmark for sliding window attention KV cache management: quality vs window size tradeoffs, SWA vs eviction comparison, prefix sharing interaction, and operational window recommendations across four attention distributions

  • Updated Jul 26, 2026
  • Python

Simulation benchmark for canary deployment strategies in LLM model updates, measuring safety, rollback behavior, bad exposure, and rollout speed across good, bad, and marginal candidate scenarios

  • Updated Jul 26, 2026
  • Python

Discrete-event simulation benchmark for decode preemption policies in LLM serving: when to interrupt a running decode to admit an urgent prefill, and whether checkpoint or recompute is cheaper.

  • Updated Jul 26, 2026
  • Python

Discrete-event simulation for LLM serving capacity planning: how many GPUs for a p99 TTFT SLO under ShareGPT traffic, batching fragmentation, and autoscaling lag — with cliff analysis and three levels of planning rigor.

  • Updated Jul 26, 2026
  • Python

Simulation benchmark for LLM serving observability design: which minimum set of signals detects all major failure modes before SLO violation, and what does each signal miss?

  • Updated Jul 26, 2026
  • Python

Monte Carlo simulation benchmark for MoE expert activation memory variability and admission control under non-deterministic routing — including routing skew amplification, top_k sweep, and policy comparison across uniform, skewed, and very_skewed distributions

  • Updated Jul 26, 2026
  • Python

Improve this page

Add a description, image, and links to the serving-systems topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the serving-systems topic, visit your repo's landing page and select "manage topics."

Learn more