{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lab6 - CS 432 Operating Systems Spring 2005 Lab 6 More...

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

View Full Document Right Arrow Icon
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. Explain why this model can make mul-
Background image of page 1

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

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

{[ snackBarMessage ]}