Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Some Distribution-Free Aspects of Paging Algorithm Performance
Journal of the ACM (JACM)
The working set model for program behavior
Communications of the ACM
Truly online paging with locality of reference
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
IEEE Transactions on Software Engineering
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
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
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the relative dominance of paging algorithms
Theoretical Computer Science
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
On certain new models for paging with locality of reference
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Bipartite graph structures for efficient balancing of heterogeneous loads
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Paging and list update under bijective analysis
Journal of the ACM (JACM)
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
Hi-index | 0.00 |
Motivated by the fact that competitive analysis yields too pessimistic results when applied to the paging problem, there has been considerable research interest in refining competitive analysis and in developing alternative models for studying online paging. In this paper, we propose a new, simple model for studying paging with locality of reference. The model is closely related to Denning's working set concept and directly reflects the amount of locality that request sequences exhibit. We use the page fault rate to evaluate the quality of paging algorithms, which is the performance measure used in practice. We develop tight or nearly tight bounds on the fault rates achieved by popular paging algorithms such as LRU, FIFO, deterministic Marking strategies and LFD. These bounds show that LRU is an optimal online algorithm, whereas FIFO and Marking strategies are not optimal in general. We present an experimental study comparing the page fault rates proven in our analyses to the page fault rates observed in practice.