| Week | Date | Topic | Assign | Collect |
| 1 | T, 1/13 | Ch1, Ch2: Overview of Operating System
- Course Overview - Embedded, time-sharing, general-purpose OS - General issues: reliability, security, performance - Main Functions of OS |
||
| R, 1/15 | Ch1, Ch2: Overview of Operating System
- Main Functions of OS - Interrupt, timer, kernel, system calls, VM |
|||
| 2 | T, 1/20 | Instructor out of town (no class) | ||
| R, 1/22 | Instructor out of town (no class) | |||
| 3 | T, 1/27 | Ch3: Processes
- PCB, state transition - Long, short term CPU scheduling - Process creation - Interprocess communication |
||
| R, 1/29 | Ch3: Processes
- Interprocess communication Ch4: Threads - Motivation - benefits - Multithreading models - Threading issues |
|||
| 4 | T, 2/03 | Ch3: Processes
- Shared memory Project 1 Ch5: CPU scheduling - Motivation - Real-time, non real-time |
Project 1 | |
| R, 2/05 | Winter Carnival (no class) | |||
| 5 | T, 2/10 | Ch5: CPU scheduling
- Preemptive, non-preemptive - Criteria - FCFS, SJF |
||
| R, 2/12 | Ch5: CPU scheduling
- FCFS, SJF, RR - Quantum vs. turnaround time - Multilevel Feedback |
|||
| 6 | T, 2/17 | Ch6: Synchronization
- Motivation - S/W solutions - H/W solutions - TestAnd Set, Swap |
HW 1 (2/18) | |
| R, 2/19 | Ch6: Synchronization
- Busy waiting - Semaphore - Classical synch' problems |
Project 1 (2/20) | ||
| 7 | T, 2/24 | HW 1 review
Ch6: Synchronization - Classical synch' problems |
HW 1 (2/23) | |
| W, 2/25 | Exam 1, 7:05-8:55pm, 138 Fisher | |||
| R, 2/26 | Ch6: Synchronization
- Classical synch' problems - Priority inversion Ch19: Real-Time Systems |
|||
| 8 | T, 3/03 | Ch7: Deadlocks
- Why deadlock? - Banker's algorithm - Avoidance - Detection |
||
| R, 3/05 | Ch7: Deadlock
Project 2 Ch8: Main Memory - CPU vs. Memory - Address binding - Logical vs. physical addresses - Swapping |
Project 2 | ||
| T, 3/10 | Spring break | |||
| R, 3/12 | Spring break | |||
| 9 | T, 3/17 | Ch8: Main memory
- Contiguous memory allocation - Paging |
||
| R, 3/19 | Ch8: Main memory
- Hierarchical paging - Hashed paging - Inverted paging |
Project 2 | ||
| 10 | T, 3/24 | Project3
- Contiguous memory allocation - MLF implementation - Typical CSIM program structure |
Project 3
Homework 2 |
|
| R, 3/26 | Ch8: Main memory
- Segmentation - Paged segmentation Ch9: Virtual memory - Demand paging - Benefit and cost |
|||
| 11 | T, 3/31 | Hw 2 review
Ch9: Virtual memory - Page replacement - Optimal, FIFO, LRU |
Homework 2 (Mon. 3/30) | |
| R, 4/02 | Exam 2 | |||
| 12 | T, 4/07 | Ch9: Virtual memory
- LRU Approximation - Thrashing, working set |
Project 3 (Mon. 4/6) | |
| R, 4/9 | MLF, CSIM
Teaching evaluation |
Project 4 | ||
| 13 | T, 4/14 | Ch11: File-System Implementation
- Contiguous, linked, indexed |
||
| R, 4/16 | Ch11: File-System Implementation
- Free space, directory management Ch12: Disk Management - Disk scheduling |
|||
| 14 | T, 4/21 | Ch11: File system implementation
- Performance issues - File system mounting |
Homework 3 | |
| R, 4/23 | HW 3 review
Ch12: Disk management - RAID |
Homework 3 (Wed. 4/22)
Project 4 (Fri. 4/24) |
||
| Finals Week | R, 4/30 | Final Exam (Comprehensive)
Thurday at 3:00pm EERC 103 |
Good luck! |