FIFO can be Better than LRU: the Power of Lazy Promotion and Quick Demotion

LRU has been the basis of cache eviction algorithms for decades, with a plethora of innovations on improving LRU’s miss ratio and throughput. While it is well-known that FIFO- based eviction algorithms provide significantly better through- put and scalability, they lag behind LRU on miss ratio, thus, cache efficiency. We performed a large-scale simulation study using 5307 block and web cache workloads collected in the past two decades. We find that contrary to what common wisdom sug- gests, some FIFO-based algorithms, such as FIFO-Reinsertion (or CLOCK), are, in fact, more efficient (have a lower miss ratio) than LRU. Moreover, we find that qick demotion — evicting most new objects very quickly — is critical for cache efficiency. We show that when enhanced by qick demotion, not only can state-of-the-art algorithms be more efficient, a simple FIFO-based algorithm can outperform five complex state-of-the-art in terms of miss ratio.

go through it again if an event happened,

but only render if the next render target has passed

also u cant multiview when theres no one near

but u can remove everyone from multiview so it does this weird thing idk lol