CS440 Operating Systems

Class Notes

• What is OS
• UNIX Basic
• UNIX Basic II
• OS Basics I: resource sharing; batch systems
• OS Basics II: Multiprogramming batch systems
• OS Basics III: Timesharing system and others; von Neumann architecture
• CU, memory, I/O Devices. Slides for charts
• ALU, DMA, race condition and Interrupts
• Parallel Computers; Process; Slides for charts
• Process, threads, address space
• OS organization
• OS organization II; Device management I; Ch5 slides
• Device management II
• Device management III (buffering; I/O bound and compute bound); optimizing seek time algorithms: FCFS (no digital notes)
• Seek time algorithms; process management
• Scheduling 
• Non-pre-emptive scheduling algorithms: FCFS. SJN, priority, deadline scheduling
• Pre-emptive scheduling algorithm: RR and RR with overhead
• Synchronization: critical section, semaphores
• Synchronization II - binary semaphore TS. Deadlock
• Deadlock: STM -- State transition model
• Banker's algorithm
• Graph reduction with RRG. Memory allocation. Slide: ch10; ch11
• Virtual memory management. Demand paging algorithms: FIFO; Belady's optimal algorithm