Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Dynamic storage allocation systems
Communications of the ACM
Amortized efficiency of list update and paging rules
Communications of the ACM
An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Asymptotic performance of a buffer model in a data sharing environment
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Performance Analysis of Cache Memories
Journal of the ACM (JACM)
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On self-organizing sequential search heuristics
Communications of the ACM
Can entropy characterize performance of online algorithms?
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On paging with locality of reference
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
IEEE Transactions on Computers
Index Access with a Finite Buffer
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Amortized efficiency of list update rules
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
On paging with locality of reference
Journal of Computer and System Sciences
A page fault equation for modeling the effect of memory size
Performance Evaluation
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms (TALG)
Some Results on Distribution-Free Analysis of Paging Algorithms
IEEE Transactions on Computers
Brief paper: Stochastic control of paging in a two-level computer memory
Automatica (Journal of IFAC)
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
| Hi-index | 0.05 |
The topic of this paper is a probabilistic analysis of demand paging algorithms for storage hierarchies. Two aspects of algorithm performance are studied under the assumption that the sequence of page requests is statistically independent: the page fault probability for a fixed memory size and the variation of performance with memory. Performance bounds are obtained which are independent of the page request probabilities. It is shown that simple algorithms exist which yield fault probabilities close to optimal with only a modest increase in memory.