Competitive Paging Algorithms
Amos Fiat, Richard Karp, Mike Luby, Lyle McGeoch, Daniel Sleator, Neal E. Young
Abstract
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. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k.
Create a lesson
Related papers
The Matching Number Characterizes the Query Complexity of Edge Counting and Degree Moment Estimation
Chenglin Fan, Wonseok Shin
Faster Deterministic Approximation for Counting Knapsack
Ce Jin, Jaewoo Park, Barna Saha
Many Scores Force Many Reads: An Optimality Proof for Score of Parentheses
Andrew Au
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk