Editing Page replacement algorithm (section)

==The (h,k)-paging problem==
The (h,k)-paging problem is a generalization of the model of paging problem: Let h,k be positive integers such that <math>h \leq k</math>. We measure the performance of an algorithm with cache of size <math>h \leq k</math> relative to [[Page replacement algorithm#The theoretically optimal page replacement algorithm|the theoretically optimal page replacement algorithm]]. If <math>h<k</math>, we provide the optimal page replacement algorithm with strictly less resource.

The (h,k)-paging problem is a way to measure how an online algorithm performs by comparing it with the performance of the optimal algorithm, specifically, separately parameterizing the cache size of the online algorithm and optimal algorithm.