An arbitration on cache replacements based on frequency — Recency product values

Evolving an efficient cache replacement policy has been a challenge since the last few decades. LRU (Least Recently Used) and LFU (Least Frequently Used) cache replacement techniques and a variety of their combinations were the most sought after. This paper proposes a new combination of the LRU and LFU in such a style that the time and complexity to replace moves below the current benchmarks. Here, a frequency-recency product value is computed which dictates the cache replacement arbitration. It out performs the existing methods by a significant reduction in computational overhead.