This schedule is tentative and most likely will be revised. Among other things, the assignments are not yet cast in stone. More assignments may be added.
You may also be interested in the Spring 2014 syllabus, which has old copies of scribe notes. The lecture topics may not line up exactly even if the titles are the same.
| date | due | readings | lecture topics | scribe notes |
|---|---|---|---|---|
| 10-06 M | 1. Introduction | Foglia et al. • Trihernawan & Bateman-Fluent | ||
| 10-08 W | §1, §2–§2.3 | 2. Abstractions and bootstrapping | (no note-takers) | |
| 10-13 M | §4–§4.1.2, §5–§5.1, §5.3 | 3. Modularity and virtualization | Nguyen | |
| 10-14 T | Lab 1a | |||
| 10-15 W | §5.5 | 4. OS organization | Gomez-Benito et al. • Ren et al. • Suttiratana et al. • Yang et al. | |
| 10-20 M | 5. Orthogonality, processes, and races | Elliott et al. • Liu et al. | ||
| 10-21 T | WeensyOS 1 | |||
| 10-22 W | §5.2 (except §5.2.5) | 6. Signals, scheduling, and threads | Li • Lutton & Yee • Wang & Cantwell | |
| 10-24 F | Lab 1b | |||
| 10-27 M | §6.3–§6.3.3 | 7. Scheduling algorithms | Eto et al. • Liu & Lee | |
| 10-29 W | §9.1.2–§9.1.7 (PDF) | 8. Consistency; critical sections | Abbott & Ahmed | |
| 10-31 F | Lab 1c | |||
| 11-03 M | §5.2.5, §5.6 | 9. Synchronization primitives; deadlock | Fischer & Giacalone • Shi et al. | |
| 11-05 W | midterm, in lecture | |||
| 11-10 M | Lab 2 | §6.1 | 10. File system performance | Cai et al. • Choi et al. • Huang & Chu • Sio et al. • Yao |
| 11-12 W | §2.5 | 11. File system design | Wong et al. | |
| 11-17 M | §6.3.4 | 12. File system implementation | Becker et al. • Chan • Issa Attar & Chohan • Shah | |
| 11-19 W | §8.1.1, §8.2.1, §8.4.1, §9.2 (PDF), POSIX defect 672 | 13. File system robustness | Takeuchi • Thorenfeldt | |
| 11-20 R | Lab 3 | |||
| 11-24 M | §5.4, §6.2 intro, §6.2.3–§6.2.9 | 14. Virtual memory | Yu & Zhou | |
| 11-26 W | §4.2, §4.3 | 15. VM and processes; distributed systems | Huang & Lu • Liu • Lu • Pan & Zhou • Xi | |
| 12-01 M | WeensyOS 2 | §4.5 | 16. Robustness, parallelism, and NFS | Hatgadkar |
| 12-03 W | §11–§11.3 (PDF), Garber 2012 | 17. Introduction to security; authentication | Drafahl • Ekmekji et al. | |
| 12-08 M | §11.4–§11.8 (PDF) | 18. Confidentiality, authorization, and protocols | Beck • Charanvattanakit • Henthorne • Makmur • Ouyang & Truong • Patel • Sakakibara • Vysotsky | |
| 12-10 W | Lab 4 | Armbrust et al. 2010 • Kivity et al. 2014 | 19. Utility computing | Nguyen & Sun |
| 12-12 F | 2- to 3-page report |
All assignments are due at 23:55 (i.e., five minutes before midnight) on the date specified. Design problem due dates are one week after the normal lab due dates, with presentations and slides due one week after that; except for Lab 4 where everything is due on the last day of instruction (please ignore statements about due dates in the design-problem web page, as that's for a previous edition of the course). Scribe notes are due one week after the lecture, except for the lecture one week before the midterm exam (due two days before the midterm), and for lectures during the last week (due Friday of the last week).
The final exam is three hours and will be held at the time scheduled by the registrar.