A Comparison of Three Page Replacement Algorithms: FIFO, LRU and Optimal

Abstract

The speed at which the process will be executed doesn't depend only on the implementation of the architecture of the computer, the frequency of the clock, but also regard to the politics the algorithm follows and the data structure the algorithm is implemented. The usage of efficient page replacement algorithms, that choose which page in memory will be swapped if a page fault, are required to implement in a virtual memory system. A lot of algorithms are developed during the years for page replacement. Each algorithm has the aim to have less number of page faults. With less page faults we have an improvement in performance and the speed of the process is increased. In this paper three algorithms (FIFO, LRU and Optimal page replacement algorithms) will be tested and will be shown the one that has the best performance.

Duplication elimination in cache-uplink transmission over B5G small cell network

“…These algorithms have time complexity O(1) and widely used in many applications such as YouTube, Twitter, Facebook [69][70][71][72]. The SBS only decides eviction when dissimilarity and SBS'cache are full.…”

A Novel Adaptive Database Cache Optimization Algorithm Based on Predictive Working Sets in Cloud Environment

“…There are few adaptive algorithms which refer to some of the historical information related to the recently evicted blocks, which is useful in finding the recent trends and the reversal in those trends [18], [23].…”

“…By using a certain precise history mechanism that remembers recently evicted pages from T1 and T2; CAR adaptively determines the sizes of these lists in a data-driven fashion. CAR combines the best features of CLOCK and ARC by removing all the disadvantages of LRU [17], [18].…”