Introduces fail-closed lowering semantics for Resident KV Claims in LLM serving runtimes, along with a conformance checker, descriptor format, and classification of existing systems.
Pie: A Programmable Serving System for Emerging LLM Applications,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Resident KV claims define a portable contract for managing future-reuse KV-cache state when active and resident allocations compete for limited memory in systems like vLLM.
citing papers explorer
-
Fail-Closed Lowering of Resident KV Claims onto LLM Serving Runtimes
Introduces fail-closed lowering semantics for Resident KV Claims in LLM serving runtimes, along with a conformance checker, descriptor format, and classification of existing systems.
-
Resident KV Claims: A Conformance Contract for Future Reuse under Active KV Pressure
Resident KV claims define a portable contract for managing future-reuse KV-cache state when active and resident allocations compete for limited memory in systems like vLLM.