CRFP: A Novel Adaptive Replacement Policy Combined the LRU and LFU Policies

摘要

A variety of cache replacement algorithms have been proposed and applied in different situations, in which the LRU (Least Recently Used) and LFU (Least Frequently Used) replacement policies are two of the most popular policies. However, most real systems don't consider obtaining a maximized throughput by switching between the two policies in response to the access pattern. In this paper, we propose a novel adaptive replacement policy that Combined the LRU and LFU Policies (CRFP); CRFP is self-tuning and can switch between different cache replacement policies adaptively and dynamically in response to the access pattern changes. Conducting simulations with a variety of file access patterns and a wide range of buffer size, we show that the CRFP outperforms other algorithms in many cases and performs the best in most of these cases.