|
Computer Science 322 Operating Systems Mount Holyoke College Spring 2010
|
|
Lecture 09: Cooperating Processes and Critical Sections
Date: Wednesday, March 3, 2010
Agenda
- Announcements
- A Computer Science Club is forming. Sign up if you are interested.
- Course evaluation volunteers
- CPU scheduling lab: code due Monday, writeup due Wednesday
- SMP/SMT scheduling
- CPU scheduling implementation wrapup: Linux O(1) and FreeBSD's ULE
- Cooperating Processes
- Bounded buffer problem
- Race conditions
- Critical Sections
- Requirements: mutual exclusion, progress, bounded waiting
- 2-process algorithms
- n-process algorithms
No New Lecture Assignment
The lecture assignment originally to be due on Monday will be part of
the next lecture assignment.
Examples
- prodcons-shmem
- prodcons-pthreads