EECS 482 - Introduction to Operating Systems
Winter 1999

Tentative Course Outline:

• Introduction: Text Ch. 1.1-1.6, 3.1-3.3 (1 week)

Class overview
What is an operating system?
History of operating systems
Operating system structures

• Process Management: Text Ch. 4.1-4.5, 6.1-6.7, Supp. reading (3 weeks)

Processes and threads
Concurrency and race conditions
Interprocess communication and synchronization
Synchronization hardware, semaphores, critical regions, monitors
Classical synchronization problems
Unix process management - Text 21.1, 21.2, 21.3.2, 21.3.4, 21.5 and Handout from text by Stevens.


• Resource Sharing: Text 5.1-5.4, Ch. 7.1-7.5 (2 week)
  

Multiprogramming
CPU scheduling
Scheduling metrics and algorithms
NT and System V Scheduling - Handout
Real-time scheduling - Handout
Deadlocks
Deadlock detection and recovery, prevention, avoidance


• Communication in Distributed Systems: Supp. Reading (1 1/2 Weeks)


Network topology, Protocol layers
Client-server model
BSD Sockets
Remote Procedure Calls
Threads (review)

• Mid-term Exam - right after spring break

• Memory Management: Text Ch. 2, 8, 9.1-9.5, 9.7, Supp. reading (2 1/2 weeks)


Structure of address spaces/address translation
Dynamic storage allocation
Memory management without swapping or paging
Swapping
Segmentation
Paging
Virtual memory (demand paging)
Caching and TLBs
Segmentation with paging
Page replacement algorithms

• File Systems: Text Ch. 10, 11, 21.7, Supp. reading (2 weeks)


File system interfaces
Files and directories
File system implementation (UNIX)
Allocation methods and free=space management
Protection
Distributed file systems: NFS vs. AFS

• Secondary Storage Management: Text Ch 2.2-2.3, selected sections from 12, 13.1-13.2, Supp. reading (1 week)


I/O hardware
I/O software, kernel I/O subsystems
Disk structure
Disk scheduling

• Security and Protection: Selected section from Ch. 19 and Ch. 20 (1/2 week - time permitting)

• Future Trends in Operating Systems

• Final Exam