|
Unit
|
Topic (s) |
Section (s)
+ Homework |
| 1 |
Computer System review
 | Course overview |
| Short History |
| Processor context and the CPU |
| Interrupts, DMA, Modes |
|
1.1-1.7
HW 1 {1, 2, 3, 7, 8}
|
| 2 |
Operating System
| Design Model; e.g., monolithic |
| Process States (NT & Unix) |
| Vector tables, code mobility |
| Control Blocks |
|
2.1-2.7; 3.1-3.2
HW 2 { 2, 3, 4, 5 }
|
| 3 |
Micro kernel, Threads, and Processes.
|
3.3-3.4; 4.1-4.5; Forks |
| 4 |
Concurrency:
| Bernstein's Conditions |
| Mutual exclusion |
| Semaphores |
| Conditional variables |
| Monitors |
| Sample Code |
|
5.1-5.7; notes |
| 5 |
Concurrency:
| Deadlock |
| Prevention |
| Avoidance |
| Detection |
| Lost Locks |
|
6.1 - 6.5 |
| 6 |
Memory Management
| Requirements |
| Partitioning |
| paging |
| segmentation |
|
7.1 - 7.4 |
| 7 |
Virtual Memory
| Hardware Support |
| Cache Mapping (associative, direct, and set) |
|
8.1 - 8.4 |
| 8 |
Scheduling
| General Problem |
| Kernel level versus App level |
|
9.1 - 9.2 |
| 9 |
I/O management
| Devices & Organization |
| Buffering |
| Disk Scheduling |
| RAID |
|
11.1 - 11.6
|
| 10 |
File Management
| Organization |
| Sharing |
|
12.1 - 12.4 |
| 11 |
Analytical Modeling
| Queuing Models |
Security
| Rainbow books |
| Threats |
|
Appendix A; 15.1 - 15.4 |
| 12 |
Distributed Systems
| Distributed mutual exclusion |
| Byzantine Generals |
|
notes |
