An enhanced least recently used page replacement algorithm

Abstract

Page replacement algorithms play a crucial role in enhancing the performance issue brought on by variations in processor speeds and memory by effectively removing pages from computer memory to improve overall efficiency. The majority of these algorithms can address the page replacement problems, but their implementation is challenging. This paper introduces a new efficient page replacement algorithm, i.e., enhanced least-replacement (E-LRU) based on two introduced features used to select the victim page. By incorporating elements of traditional algorithms such as first in first out (FIFO) and least recently used (LRU), E-LRU presents itself as a new approach with potential benefits for memory management. This study evaluates the effectiveness of E-LRU in reducing power consumption by reducing cache faults and compares its performance to existing algorithms in various settings. The results provide insight into the advantages and disadvantages of E-LRU and essential perspectives on its potential benefits for contemporary memory management algorithms. Furthermore, the study puts E-LRU into the perspective of evolving algorithms and provides directions for future investigation and improvement in the ever-changing field of memory management. The study proved that E-LRU works better than FIFO and LRU algorithms.