Emphasizing the method: Priority Page Replacement Policy: A Solution for Faster Cache Memory

This research discusses replacement algorithms in widely used computational systems. These algorithms play a crucial role in areas such as web caching, cache management in processors, page management in operating systems, and replication strategies in distributed systems. Many of these algorithms are based on LRU (Least Recently Used) and LFU (Least Frequently Used) principles, but their implementation is often complex and incurs high overhead. This paper introduces an adaptive replacement algorithm called Priority Replacement Policy (PRP), which is simple to implement and imposes minimal overhead on the system. PRP ranks pages based on three parameters and, upon a "miss" (page not found in cache), selects the lowest-priority page for replacement. This algorithm offers advantages over previous algorithms like WRP and relies on LFU in cases where LRU fails (e.g., loops). Simulation results indicate that PRP outperforms WRP, LRU, and LFU.

کلیدواژه ها:

Operating system ، Memory management ، Page replacement algorithms ، Cache memory