Model for Interactive Data Base Reference String
Malcolm C. Easton · IBM Journal of Research and Development · 1975
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.
Cited by 22 works. doi:10.1147/rd.196.0550
Authors
References
- Cache-based Computer Systems
- Properties of the working-set model
- The Single Server Queue.
- Principles of Optimal Page Replacement
- STATIONARY RANDOM FUNCTIONS
- A large-scale interactive administrative system
- Experiments with program locality
- On the Optimality of the Probability Ranking Scheme in Storage Applications
- On Optimization of Storage Hierarchies
- A model for the evaluation of storage hierarchies