Page Replacement Policies

Page Replacement Policies - Page Replacement Policies...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Page Replacement Policies During a page fault for a non-resident page Find an empty page in physical memory If RAM is full, find a page that can be replaced. Load the non-resident page from disk into RAM What page to replace? Two policies: FIFO - First In First Out
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
FIFO Page Replacement Policy First In First Out. Replace the page that has been in RAM the longest. Example. Assume 3 pages of RAM X X X 1 X X 1 5 X 1 5 3 1 5 3 1 5 3 1 6 5 3 6 1 3 6 1 3 6 1 5 6 1 6 5 VM Pages Referenced: miss miss miss miss miss hit miss hit 2 Hits 6 misses
Background image of page 2
LRU Page Replacement Policy Least recently Used. Replace the page that has not been used recently. This is a good predictor of what page will not be used in the short future. X X X 1 X X 1 5 X 1 5 3 1 5 3 1 5 3 1 1 6 3 1 6 3 1 6 3 1 6 5 6 1 6 5 VM Pages miss miss
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/30/2012 for the course CS 354 taught by Professor Staff during the Fall '08 term at Purdue University-West Lafayette.

Page1 / 5

Page Replacement Policies - Page Replacement Policies...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online