Dynamic Weight Ranking algorithm using R-F score for Efficient Caching

Abstract

There is a huge gap in the performance of the processor and the main memory. The speed of processor is much greater as compared to that of the main memory. The concept of paging has significantly increased the number of main memory accesses. In order to reduce the main memory access, a special hardware called the cache memory had been introduced. The cache memory bridges the performance gap between the main memory and the processor. This paper proposes a more efficient way to evaluate the weight factor thereby improving the results evaluated using CWRP [1]. The proposed work is easy to implement and provides better results compared to Least-Recently-Used (LRU), Clock with Adaptive Replacement (CAR) and First-In-First-Out (FIFO).