HOME PAGE
CS/MATH HOME
DIVISION HOME
VWC HOME
WEB MAIL
MARSIS

METHODS
CS/MATH INFO
VWC INFO
LINUX SERVER
THEME SONG
HOME USM 

CS440 Operating Systems Spring'04

Class Notes

• 1/27 What is OS
• 1/29 UNIX Basic
• 2/05 UNIX Basic II
• 2/10 OS Basics I: resource sharing; batch systems
• 2/12 OS Basics II: Multiprogramming batch systems
• 2/17 OS Basics III: Timesharing system and others; von Neumann architecture
• 2/19 CU, memory, I/O Devices. Slides for charts
• 2/24 ALU, DMA, race condition and Interrupts
• 2/26 Parallel Computers; Process; Slides for charts
• 3/02 Process, threads, address space
• 3/04 OS organization
• 3/09 OS organization II; Device management I; Ch5 slides
• 3/11 Test I
• 3/23 Device management II
• 3/25 Device management III (buffering; I/O bound and compute bound); optimizing seek time algorithms: FCFS (no digital notes)
• 3/30 Seek time algorithms; process management
• 4/01 Scheduling 
• 4/06 Non-pre-emptive scheduling algorithms: FCFS. SJN, priority, deadline scheduling
• 4/08 Pre-emptive scheduling algorithm: RR and RR with overhead
• 4/13 Synchronization: critical section, semaphores
• 4/15 Synchronization II - binary semaphore TS. Deadlock
• 4/20 Deadlock: STM -- State transition model
• 4/22 Test II
• 4/27 Banker's algorithm
• 4/29 Graph reduction with RRG. Memory allocation. Slide: ch10; ch11
• 5/04 Virtual memory management. Demand paging algorithms: FIFO; Belady's optimal algorithm