CS333 - Introduction to Operating Systems
Spring 2008

When: Tue/Thu 1400-1550
Where: URBAN 204
Instructor: Jonathan Walpole
Instructor Office Hours - by appointment
Teaching Assistant: Dan Coates
TA Office Hours - Monday and Wednesday 1:30-2:30pm CS Dept Fishbowl


This course will introduce the core concepts of operating systems, such as processes and threads, scheduling, synchronization, memory management, file systems, input and output device management and security. The course will consist of assigned reading, weekly lectures, a midterm and final exam, and a sequence of programming assignments. The goal of the readings and lectures is to introduce the core concepts. The goal of the programming assignments is to give students some exposure to operating system code. Students are expected to read the assigned materials prior to each class, and to participate in in-class discussions.

Students should have previous familiarity with programming in a high-level object-oriented language (such as C++ or Java); assembly language programming; CPU organization, instruction sets, registers; program development in the Unix environment (edit, compile, link, load, execute, makefile, using the shell); the Unix system call interface; basic data structures (lists, trees, graphs); object-oriented concepts (class, object, method). CS 200 and CS 201 (Computer Systems Programming I & II) are prerequisites for this class. CS 311 (Computational Structures) is also listed as a prerequisite, but the material in 311 is not closely related to this class.

Text Book
The main text book for the course will be:

        "Modern Operating Systems, 3rd edition," by Andrew S. Tannenbaum.

In addition, the following supplemental reference material will be required for the project assignments:

        "The BLITZ System", by Harry Porter, approx. 200 pages.

This packet documents the BLITZ software we'll be using in this course. This material is also available online here If you don't want to access it on line or print it off yourself there are hardcopies of the material available for purchase at CleanCopy, located on Broadway.


Your final grade will be calculated as follows:

        project - 40%;
        discussion - 10%;
        midterm exam - 25%;
        final exam - 25%;


The programming assignments for this class are based on the BLITZ system. BLITZ is a collection of software, written by Harry Porter, designed to streamline the process of learning about, and experimenting with, operating system kernel code. BLITZ includes a complete operating system, assembler, linker, loader and debugger, together with software to emulate an underlying CPU and various devices. The emulated CPU and devices are representative of real-world systems, but without some of the low-level complexity that complicates the process of learning about the key underlying concepts. By using BLITZ students are able to study, in detail, the low-level operating system code that interacts with the hardware, as well as design, code and test their own modifications to the operating system.

The assignment and due dates for each of the projects are given in the Schedule and Syllabus section of this web site (see below).

        Project 1: [ Handout.pdf ] [ Directory Containing Files ]
        Project 2: [ Handout.pdf ] [ Directory Containing Files ]
        Project 3: [ Handout.pdf ] [ Directory Containing Files ]
        Project 4: [ Handout.pdf ] [ Directory Containing Files ]
        Project 5: [ Handout.pdf ] [ Directory Containing Files ]

I will conduct regular in-class quizzes, made up of questions on the material covered up to that point in the class. Students are expected to participate in these quizzes and other in-class discussion.

Mailing List

A "MailMan" e-mailing list will be maintained for this class. The list, called cs333@cs.pdx.edu, is for communicating information relating to the course, and can be used by students as well as the TA and instructor. All students should subscribe to this list. Go to the following web page and follow the instructions:


Lecture Videos

The lectures for this class are video taped. Videos can be viewed on line at www.media.pdx.edu (password: cs333s08).

Schedule & Syllabus
Class 1
Course Overview and Introduction to Operating Systems
Course outline. Overview of course project and expectations. Introduction to hardware support for operating systems: privileged mode execution, saving and restoring CPU state, traps and interrupts, timers, memory protection. Operating system techniques for protecting user and hardware resources. Overview of the key operating system abstractions and the use of system calls to manipulate them.

Slides: [ .ppt .pdf ]
Reading: pages 1 - 80
Assign Project 1 - Introduction to BLITZ
Class 2
The Process Concept
Complete the overview of the key operating system abstractions and the use of system calls to manipulate them. Program execution, the process concept, process-related state, the process table, saving and restoring process state, the role of the scheduler.

Slides: [ .ppt .pdf ]
Reading: pages 81 - 117
Class 3
Threads and Concurrency
Threads, process context switch vs thread switch, true concurrency vs pseudo concurrency, operating systems as concurrent programs, concurrency through multi-threading, concurrency through interrupt handling, concurrent access to shared memory, race conditions, mutual exclusion, synchronization primitives based on atomic instructions.

Slides: [ .ppt .pdf ]
Reading: pages 100 - 110
Project 1 due at start of class.
Assign Project 2: Threads & Synchronization
Class 4
Synchronization Primitives
Atomic instructions, locks, spinlocks, mutex semaphores, counting semaphores, and their use in solutions to Producer Consumer synchronization.

Slides: [ .ppt .pdf ]
Reading: pages 110 - 124
Class 5
Classic Synchronization Problems
Classic synchronization problems: Producer Consumer, Dining Philosophers, Readers and Writers, Sleeping Barber.

Slides: [ .ppt .pdf ]
Reading: pages 124 - 132
Class 6
Monitors and Message Passing
Monitors, condition variables, message passing, and their use in solutions to classic synchronization problems: Producer Consumer, Dining Philosophers, Readers and Writers, Sleeping Barber.

Slides: [ .ppt .pdf ]
Reading: pages 115 - 124
Class 7
Deadlock, livelock, deadlock detection, avoidance, and prevention.

Slides: [ .ppt .pdf ]
Reading: pages 159 - 188
Project 2 due at start of class.
Assign Project 3: Synchronization Problems
Class 8
Separation of policy from mechanism, scheduling mechanisms, preemptive vs non-preemptive scheduling, example scheduling policies, FIFO, round-robin, shortest job first, priority scheduling, Unix-style feedback scheduling, proportional share scheduling, lottery scheduling.

Slides: [ .ppt .pdf ]
Reading: pages 132 - 158
Class 9
Memory Management
Memory addresses and binding, static and dynamic addresses translation, address translation using base and limit registers, memory management algorithms using linked lists and bitmaps, external and internal fragmentation, paged virtual memory.

Slides: [ .ppt .pdf ]
Reading: pages 189 - 202
Class 10
Midterm Exam
In class, closed-book exam based on material covered so far.

Reading: pages 1 - 214, 242 - 268
Class 11
Virtual Memory 1
Physical address spaces, virtual address spaces, page table design, single-level and multi-level page tables, hardware support for dynamic address translation using a TLB, hardware and software managed TLB refill.

Slides: [ .ppt .pdf ]
Reading: pages 202 - 214, 242 - 263
Class 12
Virtual Memory 2
Inverted page tables, the memory hierarchy, TLB miss faults, segmentation faults, protection faults, page faults, hardware support for memory protection, segmentation.

Slides: [ .ppt .pdf ]
Reading: pages 202 - 214, 242 - 263
Project 3 due at start of class.
Assign Project 4: Kernel Resource Managers
Class 13
Virtual Memory 3
Implementation issues, page sharing, copy-on-write, page fault handling, segmentation, segmentation with paging.

Slides: [ .ppt .pdf ]
Reading: pages 202 - 214, 242 - 263
Class 14
Paging Algorithms
Demand paging, swapping, placement and replacement algorithms, memory hierarchy revisited, overview of cache architecture, performance modeling for memory management systems.

Slides: [ .ppt .pdf ]
Reading: pages 214 - 242
Class 15
Devices, memory mapped devices, DMA, device drivers, interrupt handling, scheduled vs non-scheduled I/O processing, block vs character devices.

Slides: [ .ppt .pdf ]
Reading: pages 269 - 300, 327 - 378
Class 16
Secondary Storage Management
Disks, sectors, tracks, blocks, disk head scheduling algorithms, the file abstraction, directories, links.

Slides: [ .ppt .pdf ]
Reading: pages 300 - 327
Project 4 due at start of class.
Assign Project 5: User Level Processes
Class 17
File Systems 1
File system architecture, file system data structures and system calls.

Slides: [ .ppt .pdf ]
Reading: pages 379 - 424
Class 18
File Systems 2
File system architecture and design criteria.

Slides: [ .ppt .pdf ]
Reading: pages 424 - 452
Class 19
Protection domains and mechanisms, access control lists, capabilities, user authentication, encryption, common internal and external attacks.

Slides: [ .ppt .pdf ]
Reading: pages 583 - 670
Class 20
Class cancelled

Project 5 due in my mailbox by 4pm 6/05/08 (normal time for start of class).
Final Exam
Final Exam
Take-home exam covering the entire class. Exam paper and instructions will be emailed to class list.

Reading: pages 1 - 900

Back to Jonathan Walpole's home page