Page replacement algorithms

Optimal

We can consider the optimal PRE, which discards pages which will be used furthest into the future. It is impossible to realise, but we can simulate its performance, by running the same mix of processes twice, and using the page references from the first run to predict the page references in the second run (and use the optimal algorithm in the second run). (So can use for simulation purposes, but not in Reality).

last updated 6 March 1998