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 Winter 2012 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 | textbook readings | lecture topics | scribe notes | |
|---|---|---|---|---|---|
| 04-03 T | 1. Introduction | Bax et al. • Shah & Rishi • Yu | |||
| 04-05 R | §1, §2–§2.3 | 2. Abstractions and bootstrapping | Hung • Nakamoto et al. | ||
| 04-10 T | Lab 1a | §4–§4.1.2, §5–§5.1, §5.3 | 3. Modularity and virtualization | Abaya et al. • Eldredge • Nguy | |
| 04-12 R | §5.5 | 4. OS organization | Quon et al. • Tharanipathy et al. | ||
| 04-17 T | 5. Orthogonality, processes, and races | Sankey & Huang • Wang | |||
| 04-19 R | §5.2 (except §5.2.5) | 6. Signals, scheduling, and threads | Gerrick & Van Wonterghem • Wolf et al. | ||
| 04-20 F | WeensyOS 1 | ||||
| 04-24 T | Lab 1b | §6.3–§6.3.3 | 7. Scheduling algorithms | Banks • Li & Jung • Pang et al. | |
| 04-26 R | §9.1.2–§9.1.7 (PDF) | 8. Consistency; critical sections | (no volunteers) | ||
| 04-27 F | Lab 1c | ||||
| 05-01 T | §5.2.5, §5.6 | 9. Synchronization primitives; deadlock | Weiss | ||
| 05-03 R | midterm, in lecture | ||||
| 05-08 T | Lab 2 | §6.1 | 10. File system performance | Clark • Do | |
| 05-10 R | §2.5 | 11. File system design | Chien & Yuan • Cool & Lee • Murthy & Pham | ||
| 05-15 T | §6.3.4 | 12. File system implementation | Daskalov • Gendler et al. | ||
| 05-17 R | §8.1.1, §8.2.1, §8.4.1, §9.2 (PDF) | 13. File system robustness | Alves & Deng • Gu & Wang • Sun & Kwasnick • Zhu | ||
| 05-21 M | Lab 3 | ||||
| 05-22 T | §5.4, §6.2 intro, §6.2.3–§6.2.9 | 14. Virtual memory | Isaji & Vafai | ||
| 05-24 R | §4.2, §4.3 | 15. VM and processes; distributed systems | Chan et al. • Dang et al. • Kajla & Topiwala • Lu et al. • Solichin | ||
| 05-29 T | WeensyOS 2 | §4.5 | 16. Robustness, parallelism, and NFS | Arevalo • Jennings et al. • Shah & George | |
| 05-31 R | §11–§11.3 (PDF), Garber 2012 | 17. Introduction to security; authentication | Lee & Rabizadeh • Liu & Kwan • Millar | ||
| 06-05 T | Lab 4 | §11.4–§11.8 (PDF) | 18. Confidentiality, authorization, and protocols | Bonilla • Lee • Noor • Woo | |
| 06-07 R | Armbrust et al. 2010, Brewer 2012 | 19. Utility computing | Aguiniga • Park | ||
| 06-08 F | 2- to 3-page report |
All assignments are due at 23:59:59 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.