Amortized efficiency of list update and paging rules
Communications of the ACM
Multiprocessor cache analysis using ATUM
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line paging against adversarially biased random inputs
Journal of Algorithms
The working set model for program behavior
Communications of the ACM
SIAM Journal on Computing
SIAM Journal on Computing
On paging with locality of reference
Journal of Computer and System Sciences
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Operating System Concepts
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms (TALG)
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A comparison of performance measures via online search
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The frequent items problem in online streaming under various performance measures
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 5.24 |
In this paper, we give a finer separation of several known paging algorithms using a new technique called relative interval analysis. This technique compares the fault rate of two paging algorithms across the entire range of inputs of a given size, rather than in the worst case alone. Using this technique, we characterize the relative performance of LRU and LRU-2, as well as LRU and FWF, among others. We also show that look-ahead is beneficial for a paging algorithm, a fact that is well known in practice but it was, until recently, not verified by theory.