Subject Review: Comparing and Analyzing Page Fault Schemes According to Estimated Time

Abstract

Active page replacement approaches are required for the virtual memory for the purpose of resolving what data pages are going to be driven out from the memory when a page fault occurs. For years, a lot of algorithms have been developed to avoid page fault, all these algorithms have the efforts of decreasing the proportion related to the reduce error in the same time as incurring minimal overhead. Since up-to-date patterns of memory access have been studied, the study has the aim of creating novel methods for page replacement that can be adaptive to the varying workloads. The presented review aims of comparing the assessed replacement time for the main methods of page replacement. Some conventional methods like CLOCK and LRU will be examined, as well as some new methods like 2-DPR, CLOCK-Pro, LIRS, and CAR.