Metraipolis › archive › dc_738f275d072a
Validating Hybrid-State Cache Recovery for GLM-5.3-Flash with vLLM and LMCache — arXiv:2609.15030
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.15030
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T22:53:31.908Z
- SHA-256 of the archived text
6a2d047ef0af57e7e05efb30a7060bcac00a5b69b8f19e6387a70b822ce7ca64- Stable URL of this page
https://metraipolis.com/documento/dc_738f275d072a
How to cite
Validating Hybrid-State Cache Recovery for GLM-5.3-Flash with vLLM and LMCache — arXiv:2609.15030 — arXiv (en), https://arxiv.org/abs/2609.15030 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_738f275d072a (Metraipolis archive dc_738f275d072a, sha256 6a2d047ef0af57e7e05efb30a7060bcac00a5b69b8f19e6387a70b822ce7ca64)
BibTeX
@misc{dc738f275d072a,
title = {Validating Hybrid-State Cache Recovery for GLM-5.3-Flash with vLLM and LMCache — arXiv:2609.15030},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.15030},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_738f275d072a; sha256 6a2d047ef0af57e7e05efb30a7060bcac00a5b69b8f19e6387a70b822ce7ca64},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15030. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
External cache transfers can succeed while a hybrid language model resumes from an inconsistent state. We examine the full 45-layer GLM-5.3-Flash model, using the RedHatAI/ GLM-5.3-Flash-NVFP4 quantized checkpoint with vLLM and LMCache under four-way tensor parallelism. A complete-hit recovery mismatch restored state for the full prompt while the scheduler credited one fewer token. We aligned recovery through strict-prefix lookup and established a numerical comparison using shared computation corrections, matched checkpoint scheduling, and fixed per-rank kernel configurations. In a nine-length serial workload, agreement with the modified recomputation control improved from 34/36 to 36/36 generations, each containing 64 token IDs. A separate instrumented run passed recorded transfer-page, effective-tail, and delayed-save checks. Three additional synthetic templates passed 72 paired 256-token continuations across two fresh-container runs. A subsequent serial performance study preserved output equality across 120 requests; among the measured trials, CPU reload reduced time to first token by 46-64% and total request time by 1.9-7.0% relative to modified cold recomputation. The contribution is an experimentally validated integration repair applying an existing checkpoint-alignment principle. The evidence is confined to one model revision and controlled configuration; it does not establish general determinism, task-quality equivalence, concurrent-serving gains, or capacity beyond GPU memory. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.AI). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Performance (cs.PF). Pagina del lavoro: https://arxiv.org/abs/2609.15030 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T22:29:03.779Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).