Re:Random notes on improving the Redis LRU algorithm
by NovaX on Friday July 29, 2016 @09:56PM
(#12191274)
I also ran an exhaustive analysis and had similar conclusion. I found that TinyLFU (mentioned in the article) matches or beats LIRS in database and search workloads. It is also much simpler to implement and is more memory efficient.
The W-TinyLFU variant better handles recency by using an admission window so that new entries are not immediately discard. This resolves antirez's concern and improves performance in sparse burst workloads. In a way its similar to the HIR/LIR regions (window/main) using TinyLFU as a frequency filter.
Happy to work with you, antirez, and others to simulate more policies and add trace files.
https://github.com/ben-manes/caffeine/wiki/Efficiency
The W-TinyLFU variant better handles recency by using an admission window so that new entries are not immediately discard. This resolves antirez's concern and improves performance in sparse burst workloads. In a way its similar to the HIR/LIR regions (window/main) using TinyLFU as a frequency filter.
Happy to work with you, antirez, and others to simulate more policies and add trace files.