The Best Page to Replace
	• The best page to replace is the one that will never be accessed again • Optimal Algorithm – Belady’s Rule – Lowest fault rate for any reference string – Basically, replace the page that will not be used for the longest time in the future. – Belady’s Rule is a yardstick – We want to find close approximations