Principles of Optimal Page Replacement
Journal of the ACM (JACM)
On the Optimality of the Probability Ranking Scheme in Storage Applications
Journal of the ACM (JACM)
Properties of the working-set model
Communications of the ACM
Operating Systems Theory
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Computer
Experiments with program locality
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
| Hi-index | 0.00 |
A particularly simple Markov chain model for a reference string is described. The model, which is only slightly more complicated than the independent reference model, generates strings that have a locality property and that have a specified probability distribution of references over pages. Expressions are obtained for expected working-set size and expected working-set miss ratio. The model is used in an examination of the effect of grouping pages into blocks and in a discussion of the problem of evaluating the effect of changes in the size of the data base. Predictions of the model are shown to agree closely with observations of a string of data base references generated by an interactive data base system having a large number of concurrent users.