Page Replacement Algorithms
Goals of any page replacement algorithm
Definition – oldest page is always chosen to be replaced
Belady’s Anomaly – for some page replacement algorithms, the page-fault rate may increase as the number of allocated frames increases
Advantages – easy to understand and program
Drawbacks – performance not always good