#Systems
Why FIFO is (almost) all you need for cache eviction
Juncheng Yang
Cache eviction is usually presented as a ranking problem. LRU ranks objects by recency. LFU ranks them by frequency. More advanced algorithms combine several signals, adapt their parameters, and maintain increasingly sophisticated data structures to decide which object is least valuable.
MorphServe: Making Model Precision Elastic for Bursty LLM Serving
Juncheng Yang
Most LLM servers treat a deployed model as fixed: its weights have one precision, its KV cache has one memory budget, and both remain unchanged until the process restarts.