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 that . We measure the performance of an algorithm with cache of size relative to the theoretically optimal page replacement algorithm. If 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.
Read more about this topic: Page Replacement Algorithm
Famous quotes containing the word problem:
“And just as there are no words for the surface, that is,
No words to say what it really is, that it is not
Superficial but a visible core, then there is
No way out of the problem of pathos vs. experience.”
—John Ashbery (b. 1927)