A New Proposed Hybrid Page Replacement Algorithm (HPRA) in Real Time Systems.

Abstract

Programming code is variable length. As code size grows larger than primary memory, virtual memory is a relevant concept. As the concept suggests, virtual memory allows to extend primary storage usage with storage devices such as hard drives.When a requested page is not located in memory (page fault) or a free accessible page is insufficient to meet the request, page replacement occurs. This is because there are none, or the number of free pages is less than the requested number. The operating system handles allocating memory frames to each program when the program is loaded into memory. In this work, the three existing page replacement algorithms (FIFO, LRU, and Optimal), along with a counter variable that keeps track of the frequency of pages are combined to create a Hybrid Page Replacement Algorithm in real time (HPRA). The HPRA was assessed by contrasting its performance in terms of the number of page faults produced with the industry-standard above-mentioned page replacement algorithm.