Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
