The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A note on the calculation of average working set size
Communications of the ACM
Properties of the working-set model
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Analysis of block-paging strategies
IBM Journal of Research and Development
Generalized working sets for segment reference strings
Communications of the ACM
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Analysis of page-reference strings of an interactive system
IBM Journal of Research and Development - Nanostructure technology
Computation of Cold-Start Miss Ratios
IEEE Transactions on Computers
Model for database reference strings based on behavior of reference clusters
IBM Journal of Research and Development
| Hi-index | 48.24 |
Transient-free average working-set size and transient-free missing-page rate for a finite sample of a reference string are defined. Use of these statistics is appropriate if the contents of the working set at the start of the recorded string are unknown. If a certain stationarity condition holds, these statistics provide unbiased estimates of expected working-set sizes, missing-page probabilities, and interreference distance probabilities. Two other pairs of estimators are shown to be biased. Expressions for the transient-free statistics are obtained in terms of interval statistics. Several methods of computation are discussed, the usefulness of each depending on length of the sample, number of distinct references, and the amount of main storage available to the computer performing the calculations. In particular, methods are described for handling long strings containing many distinct page names.