cache-trace

I did not claim that DrashCache is "the absolutely best" algorithm. But some caching algorithms could be better than others on real-world data. Would you want me to run something like https://github.com/twitter/cache-trace on both Redis/(LRU,LFU) and Dragonfly and see which one has higher hit-rate for the same memory requirements? Would this be a good test to decide if Dragonfly improves on Redis caching quality?

frecency sounds similar to Redis' LFU which uses logarithmic counters [1]. Unfortunately many of these algorithms only do a good job in specific workloads and under perform in others. That's perfectly fine if one can narrow to a specific use-case, like a cache server which is LRU-biased [2], so the focus on other optimizations like Dragonfly's optimized storage costs makes a lot of sense. [1] http://antirez.com/news/109 [2] https://github.com/twitter/cache-trace

I wonder if dormando who sometimes comes around would care to run memcache with the same traces as are used in this paper, which are available at https://github.com/twitter/cache-trace. I'm not sure I care about a cache that can scale to 24 cores, as in my experience I usually end up with hundreds of caches each with a few cores rather than fewer, bigger cache servers, but it still would be interesting to see what memcached can do.