Myvideo

Guest

Login

CS162 Lecture 16: Memory 4: Demand Paging Policies

Uploaded By: Myvideo
0 views
0
0 votes
0

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.

Share with your friends

Link:

Embed:

Video Size:

Custom size:

x

Add to Playlist:

Favorites
My Playlist
Watch Later