Count Based Page Replacement Technique
It is important for a virtual memory system to be able to efficiently replace a page when a page fault occurs. Over time many algorithms have been developed to decrease time needed to make a decision whilst also minimizing overhead required to perform this. Here a theoretical approach is developed which like the optimum replacement technique can be used as a standard to compare the different existing algorithms. 'n' pages are calculated and 'n' variables are created to keep a count on the number of times each page is called. Each time a fault occurs we replace the page having minimum value of count among all the existing variables.
Index Terms- Page Replacement, LRU, Count, Page Fault