|
|
Computer Science 322
Operating Systems
Mount Holyoke College
Spring 2010
|
|
Lecture 13: Semaphore Implementations; Deadlock
Date: Wednesday, March 24, 2010
Agenda
- Announcements
- A closer look at the producer consumer example with a POSIX
semaphore protecting shared access to the counter variable
- POSIX Semaphore Implementation
- SysV Semaphore Example and Implementation
- Deadlock
- Idea
- Necessary conditions: mutex, hold and wait, no preemption, circular wait
- Resource allocation graphs
- Exam 1 Out
No New Lecture Assignment
You have an exam and then a lab assignment to worry about. Lecture
assignments resume next week.