cs162_fa08_mt1 - on programmer. Problem 1c[3pts]: The SRTF...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 162 Fall 2008 Midterm Exam I October 15, 2008 Page 3/21 Problem 1: Short Answer [24pts] Problem 1a[2pts]: Give at least two reasons why the following implementation of a condition variable is incorrect (assume that MySemi is a semaphore initialized to 0): Wait() { MySemi.P(); } Signal() { MySemi.V(); } Problem 1b[4pts]: What is the difference between Mesa and Hoare scheduling for monitors? Include passing of locks between signaler and signalee, scheduling of CPU resources, and impact
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: on programmer. Problem 1c[3pts]: The SRTF algorithm requires knowledge of the future. Why is that? Name two ways to approximate the information required to implement this algorithm. Problem 1d[3pt]: What is priority donation? What sort of information must the OS track to allow it to perform priority donation?...
View Full Document

This note was uploaded on 08/26/2009 for the course CS 162 taught by Professor Kubiatowicz during the Spring '02 term at University of California, Berkeley.

Ask a homework question - tutors are online