CS162 Lecture 16: Memory 4: Demand Paging Policies 

In this lecture, we discuss the need for demand paging replacement polices. We investigate simplistic policies such as FIFO, RANDOM, and MIN. We then present a variety of Clock algorithms and the Second Chance algorithm.