Computer Science 330
Operating Systems
Spring 2012, Siena College
Lecture 6: CPU Scheduling for Multiprocessors; CPU Scheduling Implementations; Cooperating Processes Introduction
Date: Thursday, February 2, 2012
Agenda
- Announcements
- Lab 2 and Project 1 due tomorrow
- Lecture assignment 5 recap
- Comparisons of scheduling algorithms
- What about scheduling in systems with multiple CPUs?
- scaling
- locking issues
- processor affinity
- load balancing
- Implementations of scheduling algorithms
- From the text: Solaris, Win XP, Linux
- From Krohn 2003: Linux 2.6 O(1) scheduler
- From McKusick and Neville-Neil 2004: FreeBSD 5.x ULE scheduler
- Cooperating Processes: the bounded buffer problem
Lecture Assignment 6
Due at the start of class, Tuesday, February 7.
The readings for next class are SG&G Chapter 6.
- Read and briefly summarize in a few paragraphs the key points
about the Linux 2.6 scheduler as described in the article by Krohn
(2003) that was emailed to you.
- Read and briefly summarize in a few paragraphs the key points
about the FreeBSD ULE scheduler as described in the McKusick and
Neville-Neil ACM Queue (2004) article that was emailed to you.