Amortized efficiency of list update and paging rules
Communications of the ACM
Modern operating systems
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
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
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The cost of offline binary search tree algorithms and the complexity of the request sequence
Theoretical Computer Science
Workstation capacity tuning using reinforcement learning
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
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. The goal is to devise models in which theoretical results capture phenomena observed in practice.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 demonstrate that our model is reasonable from a practical point of view.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. It shows 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. This is the first such study for an alternative/refined paging model.