Computer Science 330
Operating Systems
Spring 2012, Siena College
Lecture 7: FreeBSD and Linux Scheduling; Cooperating Processes and Critical Sections
Date: Tuesday, February 7, 2012
Agenda
- Announcements
- CPU Scheduling notes have been updated
- Lecture assignment 6 recap
- CPU scheduling implementation wrapup: Linux O(1), Linux CFS, 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
Lecture Assignment 7
Due at the start of class, Thursday, February 9.
Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
jteresco AT siena.edu by the start of class. Please use a clear subject line
when submitting by email (e.g., CS 330 Lecture
Assignment 7, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.
- SG&G Exercise 6.7, p. 259-260 (6 points)
- SG&G Exercise 6.9, p. 260 (3 points)
Examples
- prodcons-shmem
- prodcons-pthreads
Links