A tenant that fills a shared LLM prefix cache with new, never-reused data is made to pay for evictions first, protecting other tenants' cached prompts while preserving idle-capacity borrowing.
TinyLFU: A highly efficient cache admission policy,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Preserving Admission Responsibility in Multi-Tenant Large Language Model Prefix Caches
A tenant that fills a shared LLM prefix cache with new, never-reused data is made to pay for evictions first, protecting other tenants' cached prompts while preserving idle-capacity borrowing.