An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms

The goal of any page replacement algorithm is to reduce fault rate by selecting best victim page to remove. This paper presents a framework through which, we tried to compare our previous work i.e. H-LRU [1] with other existing algorithms and prove that it has a better performance in average than former methods. Our major attempt in this paper is to extend our previous work HLRU and to compare characteristics of some former methods with HLRU. The general idea behind the comparison is to evaluate the hit ratio of pages for different algorithms and to prove that it has the best performance among all.For this purpose we consider traditional algorithm like FIFO, LRU and some recent approaches like PRO-LRU, H-LRU