Use of the LRU stack depth distribution for simulation of paging behavior
Communications of the ACM
Modeling, measurement and computer power
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
| Hi-index | 0.02 |
This paper appears in the March, 1972, issue of the Communications of the ACM. Its abstract is reproduced below. A program's working set W(t,T) at time t is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (least recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.