hw03 - CS 411 Operating Systems II Homework Assignment #3...

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

View Full Document Right Arrow Icon
CS 411 Operating Systems II Spring 2009 Homework Assignment #3 To be discussed in class A system that uses demand paging has 5 frames, all initially empty. Given the page-reference string: 1,1,3,5,2,2,6,8,7,6,2,1,5,5,5,1,4,9,7,7 1. FIFO page-replacement algorithm. a. Fill in the following table for a FIFO page-replacement algorithm. The first few entries are provided. Requested Page Frame 1 Frame 2 Frame 3 Frame 4 Frame 5 Page Fault 1 1 - - - - y 1 1 - - - - n 3 1 3 - - - y 5 2 2 6 8 7 6 2 1 5 5 5 1 4 9 7 7 b. How many page faults are generated using FIFO ? ____________________ 2. LRU page-replacement algorithm. a. Fill in the following table for a LRU page-replacement algorithm. (Use FIFO to resolve ties.) Requested Page Frame 1 Frame 2 Frame 3 Frame 4 Frame 5 Page Fault 1 1 3 5 2 2 6 8 7 6 2 1 5 5 5 1 4 9 7 7 b. How many page faults are generated using LRU ? ____________________
Background image of page 1

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

View Full DocumentRight Arrow Icon
A system that uses demand paging has 5 frames, all initially empty. Given the page-reference string: 1,1,3,5,2,2,6,8,7,6,2,1,5,5,5,1,4,9,7,7
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

hw03 - CS 411 Operating Systems II Homework Assignment #3...

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