The Work Function Algorithm for the Paging Problem

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults in a two-level store. It is a special case of the famous k-server problem. In this paper, we firstly show that WFA is kM/m-competitive for the k-server problem where the distances between two points are all in [m,M] (0更多