Hybrid Page Replacement Algorithm

Page replacement algorithms play essential roles in virtual memory management, especially in Operating Systems that uses paging. Pagereplacement occurs when a requested page is not found in the memory (page fault) or a free available page is not enough to satisfy the request. This is because there are none, or the number of free pages is lower than the number requested. In this study, two standard page replacement (Least Recently Used LRU and OptimalOPT algorithms) were hybridized as hybrid page replacement (HRA). HRA based on the concept of OPT and LRU for it operation. The HRA was evaluatedby comparingit performance in terms of number of page faults generated with the standard page replacement algorithms, namely First InFirst Out FIFO, LRU and Optimal. Results showed that HRA outperformedFIFO, OPT and LRU when the number of frames increases to 4 and above.