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:
“How much atonement is enough? The bombing must be allowed as at least part-payment: those of our young people who are concerned about the moral problem posed by the Allied air offensive should at least consider the moral problem that would have been posed if the German civilian population had not suffered at all.”
—Clive James (b. 1939)