AWRP: Adaptive Weight Ranking Policy for Improving Cache Performance

TL;DR

This paper introduces AWRP, an adaptive cache replacement policy that outperforms traditional algorithms like LRU, FIFO, and CAR by offering lower overhead and better performance, as demonstrated through simulations.

Contribution

The paper proposes a novel adaptive cache replacement policy called AWRP that improves cache performance with low overhead and ease of implementation.

Findings

AWRP outperforms LRU, FIFO, and CAR in simulations.

AWRP has lower overhead and better adaptability.

Simulation results confirm improved cache hit rates.

Abstract

Due to the huge difference in performance between the computer memory and processor, the virtual memory management plays a vital role in system performance. A Cache memory is the fast memory which is used to compensate the speed difference between the memory and processor. This paper gives an adaptive replacement policy over the traditional policy which has low overhead, better performance and is easy to implement. Simulations show that our algorithm performs better than Least-Recently-Used (LRU), First-In-First-Out (FIFO) and Clock with Adaptive Replacement (CAR).