What is the criteria for the best page replacement algorithm?
1. It should be good in predicting which page wouldn't be needed for the maximum amount of time, so that it can be selected as the victim and swapped onto the disk.
2. It should use minimal resources (in terms of computation and memory) to identify the victim.
There are a number of algorithms suggested including Random, Least recently used, First chance algorithm etc. First chance looks to be the best algorithm