Analysis of the PFF replacement algorithm via a semi-Markov model
- 1 May 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 19 (5) , 298-304
- https://doi.org/10.1145/360051.360234
Abstract
An analytical model is presented to estimate the performance of the Page Fault Frequency (PFF) replacement algorithm. In this model, program behavior is represented by the LRU stack distance model and the PFF replacement algorithm is represented by a semi-Markov model. Using these models, such parameters as the inter-page-fault interval distribution, the probability of the number of distinct pages being referenced during an inter-page-fault interval, etc. are able to be analytically determined. Using these models to evaluate these parameter values permits study of the performance of the replacement algorithm by simulating the page fault events rather than every page reference event. This significantly reduces the required computation time in estimating the performance of the PFF algorithm.Keywords
This publication has 7 references indexed in Scilit:
- Locality in Page Reference StringsSIAM Journal on Computing, 1972
- Experiments with program localityPublished by Association for Computing Machinery (ACM) ,1972
- The page fault frequency replacement algorithmPublished by Association for Computing Machinery (ACM) ,1972
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- An analysis of paging and program behaviourThe Computer Journal, 1970
- Further experimental data on the behavior of programs in a paging environmentCommunications of the ACM, 1968
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966