On the Relative Dominance of Paging Algorithms

In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique compares the fault rate of two paging algorithms across the entire range of inputs of a given size rather than in the worst case alone. Using this technique we characterize the relative performance of LRU and LRU-2, as well as LRU and FWF, among others. We also show that lookahead is beneficial for a paging algorithm, a fact that is well known in practice but it was, until recently, not verified by theory.

• Type: Conference
• Year: 2007
• Where: ISAAC
• Authors: Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
• Keywords: ISAAC 2007, Paging Algorithm, Relative Interval Analysis, finer Separation