Journal of the ACM (JACM)
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The working set model for program behavior
Communications of the ACM
Analysis of computational systems: Discrete Markov analysis of computer programs
ACM '65 Proceedings of the 1965 20th national conference
An inter-reference gap model for temporal locality in program behavior
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
EELRU: simple and effective adaptive page replacement
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Approach to Program Behavior Modeling and Optimal Memory Control
Journal of the ACM (JACM)
Expressing meaningful processing requirements among heterogeneous nodes in an active network
Proceedings of the 2nd international workshop on Software and performance
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
The EELRU adaptive replacement algorithm
Performance Evaluation
General adaptive replacement policies
Proceedings of the 4th international symposium on Memory management
A note on an empirical study of paging on an IBM 370/145
ACM SIGMETRICS Performance Evaluation Review
Joint Power Management of Memory and Disk
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Brief paper: Stochastic control of paging in a two-level computer memory
Automatica (Journal of IFAC)
| Hi-index | 48.22 |
An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A first order Markov model of program behavior is assumed, and a representation of the system based on memory states, control states, and memory substates is presented. The algorithm is general in the sense that the page fault probabilities can be calculated for nonpredictive replacement rules applied to any program represented by a one-step Markov chain. A detailed example is given to illustrate the algorithm for Random and Least Recently Used (LRU) replacement rules.