This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 432 Operating Systems Spring 2005 Lab 6 – More Semaphores, Deadlock Due: Never, but look at these before the exam This week’s lab consists only of questions to look at on your own (not to be turned in). Make sure you understand these questions before the midterm exam. Practice Questions • Show that semaphores and monitors are equivalent (show how to implement each using the other). • Describe how you would implement a “nice” semaphore, like the ones we assumed we had for the sleeping barber and the dining savages, using System V semaphores. • SG&G 7.1 • SG&G 7.11 • SG&G 7.14 • A system has two processes and three identical resources. Each process needs a maxi- mum of two resources. Is deadlock possible? Why or why not? Old Exam Questions These questions are from the midterm given in the last version of this course. There were actually more questions, but our exam will cover only up to deadlock. Last time, the exam was not held until after the first few lectures on memory management. That exam also had a more strict time limit of 120 minutes, so I will be able to ask longer questions this time around. 1. Processes and Threads (7 points) a. Threads share more context than processes. Name two advantages that this affords threads over processes. (2 points) b. Consider an environment where there is a one-to-one mapping between user-level threads and kernel-level threads that allows one or more threads within a process to issue blocking system calls while other threads continue to run.system calls while other threads continue to run....
View Full Document
This note was uploaded on 01/18/2012 for the course INFORMATIK 2011 taught by Professor Phanthuongcang during the Winter '11 term at Cornell University (Engineering School).
- Winter '11