hw02Solutionsa

hw02Solutionsa - CS 411 Operating Systems II Homework...

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

View Full Document Right Arrow Icon
CS 411 Operating Systems II Spring 2009 Homework Assignment #2 Solutions 1. Given the following memory partitions and processes 0 - 3 to be loaded (in numerical order) using contiguous allocation . Specify any processes that can not be loaded, and continue the loading cycle. Partition # Size in KB Process # Size in KB 0 100 0 312 1 300 1 117 2 500 2 312 3 400 3 226 4 200 A. Show memory allocation using the first-fit storage allocation algorithm. Process #3 can’t be loaded B. Show memory allocation using the best-fit storage allocation algorithm. C. Show memory allocation using the worst-fit storage allocation algorithm. Process #2 can’t be loaded 2. Suppose that the TLB search takes 100 nanoseconds, and a memory access takes 1 microsecond. (1 μs = 1000 ns) A. How long does it take to get the base address of a page frame that is in the TLB ? __1100__ns TLB relates logical page# to physical frame#. B. How long does it take to get the base address of a page frame that is not in the TLB ? __2100__ns TLB access(100), find physical frame#(1000), find base address(1000)
Background image of page 1

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

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

This note was uploaded on 06/28/2009 for the course CS 411 taught by Professor Staff during the Spring '08 term at Oregon State.

Page1 / 2

hw02Solutionsa - CS 411 Operating Systems II Homework...

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