General InformationInstructor: Dianna Xu , 246A Park Hall, 526-6502
Lab Hours: Thursdays 1-2pm Office hours: Tuesdays 1-3pm
|
| Week | Topic |
|---|---|
| 1 | Introduction to OS, Unix processes and system calls |
| 2 | Processes and threads, concurrent programming and IPC |
| 3 | Synchronization, semaphores and mutual exclusion. Interprocess communication and synchronization |
| 4 | Scheduling, real-time scheduling |
| 5 | Resource allocation, deadlocks and starvation |
| 6 | Midterm 1, Memory management, swapping |
| 7 | Virtual Memory |
| 8 | Spring break! |
| 9 | Paging, page replacement |
| 10 | I/O and devices, disks. |
| 11 | File systems. |
| 12 | File systems. Multiprocessor and distributed systems. |
| 13 | Midterm 2, Security and protection. |
| 14 | Security and protection. Case studies and discussions |
| 15 | Case studies and final review. |
Detailed syllabus will be posted here as the semester progresses
Read: Tannenbaum 2.1 and 1.6 (again) carefully
Lab: lab02.pdf
Homework (due Tuesday 2/1): hw1.pdf
Jan 28: Processes and threads
Read: Tannenbaum 2.2, lecture notes
Read: Tannenbaum 2.3, lecture notes
Lab: lab03.pdf
Homework (due Thursday 2/11): hw2.pdf
Feb 4: Synchronization and Classic IPC Problems
Read: Tannenbaum 2.5, lecture notes
Read: Tannenbaum 2.4, lecture notes
Feb 11: Scheduling continued
Read: Tannenbaum 2.4
All graded work will receive a score out of 100. Guidelines of letter grades corresponding to lab/exam score levels will also be given. At the end of the semester, a total score (to which the corresponding final grade is assigned) will be calculated from a weighted average of all scores according to the following weights:
Programming
Assignments: 50%
Exams: 30%
Written Homeworks and discussions: 20%
Total: 100%
There are weekly or bi-weekly programming assignments and/or short writings as well as 2 in-class exams.
There is also a final paper on OS security, based on the course material and related readings. More details will be given out during class.