mlsanityData to 14 Oct 2026

Fast Recovery for LLM Serving via Decoupled Device Memory Lifetime in Dynamo

arXiv 2609.25451 ↗First posted 21 Sep 2026cs.DCcited by 0

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

Large language model (LLM) inference replicas run across tightly coupled GPUs and serve traffic continuously for weeks. Hardware and software failures are therefore inevitable, and one worker failure can disrupt an entire replica. Recovery requires reinitializing the engine, taking minutes even when weights and compilation artifacts are cached. Production deployments overprovision serving capacity to mask this window. We argue that the dominant cost is loss of ready serving capacity, not request progress, so recovery should preserve initialized engine state rather than reconstruct it. We present fast recovery for Dynamo based on this principle. Snapshots capture an initialized engine once and restore it instead of reinitializing it. Analysis of 18 weeks of failures from the Dynamo cluster shows that most failures are device-preserving: the engine process fails while the GPU and its resident allocations remain intact. Our key insight is that independent engine processes can reuse the same GPU-resident state while keeping mutable execution state private. The GPU Memory Service (GMS) decouples device-memory ownership from engine processes, enabling engines to share and reattach surviving allocations without copying them. GMS preserves model weights and shares them read-only between replacement and Shadow Engines, avoiding weight reloads. A second initialized runtime on the same GPUs reduces recovery to promotion. Across four models on vLLM and SGLang, these mechanisms recover a failed replica in under 7 seconds, 13-29 times faster than a warm restart, using a fixed 4-8 GiB of device memory per GPU independent of model size. Replaying the production trace, we estimate they would reclaim 79% of GPU-hours lost to recovery.

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 30 of its 67 references that are in the map. First posted on arXiv 21 Sep 2026.

Builds on

30 of 67 references.

Closest ancestors · 11

Same direction, newest first

  1. 2026LUMEN: Coordinated Failure Recovery for Distributed LLM Serving16 Jun
  2. 2026Foundry: Template-Based CUDA Graph Context Materialization for Fast LLM Serving Cold Start8 Apr
  3. 2026GhostServe: A Lightweight Checkpointing System in the Shadow for Fault-Tolerant LLM Serving26 Mar
  4. 2026Towards Resiliency in Large Language Model Serving with KevlarFlow30 Jan
  5. 2025FailSafe: High-performance Resilient Serving18 Nov
  6. 2025Prism: Cost-Efficient Multi-LLM Serving via GPU Memory Ballooning6 May
  7. 2025HydraServe: Minimizing Cold Start Latency for Serverless LLM Serving in Public Clouds21 Feb
  8. 2024vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention7 May
  9. 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Serve4 Mar
  10. 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving18 Jan
  11. 2023SpotServe: Serving Generative Large Language Models on Preemptible Instances27 Nov

Other references · 19

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  2. 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
  3. 2023CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Servingcited by 203
  4. 2024Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttentioncited by 163
  5. 2025LMCache: An Efficient KV Cache Layer for Enterprise-Scale LLM Inferencecited by 126
  6. 2024MegaScale: Scaling Large Language Model Training to More Than 10,000 GPUscited by 112
  7. 2024D'ej`aVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Servingcited by 48
  8. 2023Oobleck: Resilient Distributed Training of Large Models Using Pipeline Templatescited by 40
  9. 2024BLITZSCALE: Fast and Live Large Model Autoscaling with O(1) Host Cachingcited by 25
  10. 2024ByteCheckpoint: A Unified Checkpointing System for Large Foundation Model Developmentcited by 24
  11. 2023Torpor: GPU-Enabled Serverless Computing for Low-Latency, Resource-Efficient Inferencecited by 13
  12. 2021Benchmarking, Analysis, and Optimization of Serverless Function Snapshotscited by 12
7 more
  1. 2024PhoenixOS: Concurrent OS-level GPU Checkpoint and Restore with Validated Speculationcited by 6
  2. 2025Towards Efficient and Practical GPU Multitasking in the Era of LLMcited by 6
  3. 2025CRIUgpu: Transparent Checkpointing of GPU-Accelerated Workloadscited by 5
  4. 2020CRAC: Checkpoint-Restart Architecture for CUDA with Streams and UVMcited by 4
  5. 2025AnchorTP: Resilient LLM Inference with State-Preserving Elastic Tensor Parallelismcited by 3
  6. 2026Making MoE-based LLM Inference Resilient with Tarragoncited by 2
  7. 2026ReviveMoE: Fast Recovery for Hardware Failures in Large-Scale MoE LLM Inference Deploymentscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Saving GPU Hours in LLM Inference System Development and Online Workloads with Simulation and DBMS-Inspired Cache Replacement Policies
  2. 2026Concordia: JIT-Compiled Persistent-Kernel Checkpointing for Fault-Tolerant LLM Inference
  3. 2026The Serialized Bridge: Understanding and Recovering LLM Serving Performance under Blackwell GPU Confidential Computing
  4. 2026CacheFlow: Efficient LLM Serving with 3D-Parallel KV Cache Restoration
  5. 2025PRESERVE: Prefetching Model Weights and KV-Cache in Distributed LLM Serving
  6. 2024KVDirect: Distributed Disaggregated LLM Inference
  7. 2025RAPID-LLM: Resilience-Aware Performance analysis of Infrastructure for Distributed LLM Training and Inference ↗
  8. 2026A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints