Replacing the cache replacement algorithm in memcached
Redis is more popular nowsaday event for memcache’ usecase. However, this post is still useful
about technique memcache used to use to handle the LRU cache and the new algorithm to solve old pain point about spiking in cpu, not delete item until access. With the original LRU, scaling beyond 8 worker threads was difficult
Appears in lists (1)
More like this (3)
Gocache: A Complete and Extensible Go Cache Library — A “complete” cache library with adapters for...
Ristretto: A High-Performance, Concurrent, Memory-Bound Cache — The folks at Dgraph needed a better cache and...