Exploring Replacement Policy for Memcached
Gi Lee, Byoung Jin Kim, Eui-Young Chung · 2020
Caching efficiency is critical to performance when an in-memory database system acts as a cache for a disk-oriented database system. Memcached, one of the widely used in-memory database that stores key-values, roles as a cache for high-speed data storage layer. It replaces items using LRU replacement policy when memory capacity is used up. Other than LRU policy for maximizing temporal locality, in this paper, we confirm the impact of replacement policies for workloads with random pattern operations. We analyze hit counts of workload by applying BIP and SRRIP replacement policies to Memcached. Experimental results show that hit counts of Memcached to which SRRIP is applied is improved by up to 12%.