spring08_homework3B

spring08_homework3B - LRU Time 1 2 3 4 5 6 7 8 9 10 11 12...

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

View Full Document Right Arrow Icon
Homework 3B (30 Points) CS 143A, Spring 2008 Start Early. Do not hesitate to ask questions. If you make any assumptions, state them and be brief in your answers. Hand in your homework to the distribution center before the following due  date/time. Due Date: 6/6/08 Friday 4pm Question 1 (20 points):  Consider the following page reference string: a, b, g, a, d, e, a, b, a, d, e, g, d, e, a, b, c, d, a, b How many page faults would occur for the following replacement algorithms, assuming four frames?  Remember that all frames are initially empty, so your first unique pages will all cost one fault each. 
Background image of page 1

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

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

Unformatted text preview: LRU Time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 RS a b g a d e a b a d e g d e a b c d a b Frame 0 Frame 1 Frame 2 Frame 3 IN OUT Total Faults: MIN Time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 RS a b g a d e a b a d e g d e a b c d a b Frame 0 Frame 1 Frame 2 Frame 3 IN OUT Total Faults: Question 2 (10 points): Consider the following reference string: a,b,c,d,a,b,e,a,b,c,d,e Determine the number of page faults generated using a FIFO page replacement scheme for a number of frames ranging from 1 to 6. Illustrate Belady's anomaly by plotting the number of page faults against the number of frames....
View Full Document

Page1 / 2

spring08_homework3B - LRU Time 1 2 3 4 5 6 7 8 9 10 11 12...

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

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