Measurement criteria for virtual memory paging rules
John W. McCredie · 1969
Systems analysts are designing algorithms to reduce the large overhead costs of present paging schemes in virtual memory computer systems. In this paper an analytic and a simulation model expose serious deficiencies of a well known definition of a “bad replacement” in such systems. The use of this complex definition to evaluate replacement rules can actually lead to degraded performance. A simpler definition is proposed. The analysis indicates that for the class of problems studied, simulation techniques appear to have advantages over probabilistic models.