OS_Lec17_Temp - Ch.9 EE2010 Lecture 17 9 implementation...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Ch.9 EE2010 Lecture 17 9 implementation counter stack LRU no of faults. .... LRU Approximation Algorithms LRU page replacement systems Reference bit supported by HW reference bit entry in the page table (with each page) = .... OS J reference page reference bit 1 HW pages reference pages . pages Second chance algorithm reference bit = ... page reference bit = 1 = .. 1 .. ... reference bit = victim page PDF created with pdfFactory trial version www.pdffactory.com Ch.9 EE2010 Counting Algorithms FIFO or optimal time reference counting reference page reference 2 algorithms Least frequently used (LFU) page count ... count active Most frequently used (MFU) page count .. page reference Allocation of Frames instruction process frames...
View Full Document

This note was uploaded on 05/06/2011 for the course CS 12 taught by Professor Staff during the Spring '08 term at University of Texas at Austin.

Page1 / 11

OS_Lec17_Temp - Ch.9 EE2010 Lecture 17 9 implementation...

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

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