I will use these note in the lectures for CS537. You should print out each week's lectures and review the notes before class. Bring these to class so that you won't have to spend as much time during lecture writing.

I am currently updating a few sections of the notes. The sections marked with a "*" are not yet finished.

Section 1 Course Overview Processes, Synchronization, and Scheduling: Section 2 Introduction to Processes Section 3 Dispatching and Creating Processes Section 3A Entering and Exiting the Kernel Section 4 Independent and Cooperating Processes Section 5 Synchronization: The Too Much Milk Problem Section 6 Semaphores and Producer/Consumer Problem Section 7 Semaphore Example: Readers and Writers Section 8 Monitors Section 9 Message Systems Section 10 Semaphore Implementation Section 11 Scheduling and CPU Scheduling Section 12 Deadlock Memory Management and Virtual Memory: Section 13 Storage Allocation Section 14 Sharing Main Memory Section 15 Base and Bounds, Segmentation Section 16 Paging Section 17 Translation Buffers and Inverted Page Tables Section 18 Virtual Memory, Page Faults Section 19 Page Selection and Replacement Section 20 Clock Algorithm, Thrashing Section 21 Working Sets Section 21A Virtual Machines (PDF file) I/O and File Systems: Section 23 Files, Disk Management Section 24 Unix and DEMOS Disk Allocation Section 25 Directories Section 26 Windows (NT) File System Section 27 File System Crash Recovery Section 28 Disk Scheduling Protection and Security: Section 29 Protection and Security Section 30* Security Abuses Section 31* Security Improvmenets, Encryption

Other 1 C Programming Other 2 Debuggers Other 3 Source code control

Last modified: Tue Apr 26 10:22:02 CDT 2011 by bart
Copyright © 2001, 2002, 2008, 2011 Barton P. Miller