CS3841 Schedule Tentative Schedule See also the day-by-day <a href="slides">slides</a>, where I will place the lecture slides as we use them throughout the quarter, and the week-by-week <a href="Outcomes">Outcomes</a>. <!--(opt) is an abbreviation for (optional). --> | Week | Lecture | Topics | Reading | |:-------|----------:|:-----------------------------------------|:-----------------------------| | 1 | 1 | Course Introduction | Chapter 1 | | | 2 | An Introduction to Operating Systems | Sections 2.1, 2.2, 2.3, 2.4 | | | 3 | System Calls | Sections 2.9, 2.10, 2.11 | | 2 | 1 | Processes | Section 3.1, 3.2, 3.3 | | | 2 | Process Control | Sections 3.4, 3.5, 3.6 | | | 3 | Creating Multiprocess Code in Linux | | | 3 | 1 | Interprocess Communications | | | | 2 | Interprocess Communications with Sockets | | | | 3 | Remote Procedure Calls | | | 4 | 1 | Threads | Section 4.1, 4.2 | | | 2 | Thread Construction | Section 4.6 | | | 3 | Concurrency | Section 5.1, 5.2 | | 5 | 1 | Mutual Exclusion: Implementation | Sections 5.3, 5.4 | | | 2 | Monitors and Message Passing | Section 5.5, 5.6 | | | 3 | Deadlock | Section 6.1, 6.2 | | 6 | 1 | TBA & Half Exam Review | None | | | 2 | **Half Exam I** | None | | | 3 | Scheduling Introduction | Section 9.1, | | 7 | 1 | Scheduling Algorithms | Section 9.2 | | | 2 | Scheduling Problems | No new reading | | | 3 | Linux scheduling | 9.3, 10.3 | | 8 | 1 | Memory Management& Half Exam Review | 7.1, 7.2 | | | 2 | **Half Exam II** & Paging | 7.3, 7.4 | | | 3 | Loading and Linking | 7A | | 9 | 1 | Hardware and Control Structures | 8.1 | | | 2 | Page replacement | 8.2 | | | 3 | IO Management | 11.1, 11.2, 11.3, 11.4, 11.5 | | 10 | 1 | Disk Scheduling | 12.1, 12.2, 12.4, 12.5 | | | 2 | File allocations | 12.7, 12.8, 12.9, | <br> <br> Acknowledgement: Dr. Schilling wrote the original version of the outcomes for this class.