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 2013 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-02 T | 1. Introduction | Beckemeyer & Westenberg • Chan & Kwok • Tung & Khurana • Wang & Holtzen | ||
| 04-04 R | §1, §2–§2.3 | 2. Abstractions and bootstrapping | Acklander et al. • Pimentel • Stanford | |
| 04-09 T | §4–§4.1.2, §5–§5.1, §5.3 | 3. Modularity and virtualization | Choi & Xu • Lung • Sharf et al. | |
| 04-10 W | Lab 1a | |||
| 04-11 R | §5.5 | 4. OS organization | Amini & Marteja • Tong | |
| 04-16 T | 5. Orthogonality, processes, and races | Lin & Ma • Ramesh & Nagaraja • Sok | ||
| 04-17 W | WeensyOS 1 | |||
| 04-18 R | §5.2 (except §5.2.5) | 6. Signals, scheduling, and threads | Sunleng | |
| 04-22 M | Lab 1b | |||
| 04-23 T | §6.3–§6.3.3 | 7. Scheduling algorithms | Cassacia & Oshidary • Ryan et al. | |
| 04-25 R | §9.1.2–§9.1.7 (PDF) | 8. Consistency; critical sections | Crumm & Petkov • Hansberry et al. • Woytowitz | |
| 04-26 F | Lab 1c | |||
| 04-30 T | §5.2.5, §5.6 | 9. Synchronization primitives; deadlock | Shabbir | |
| 05-02 R | midterm, in lecture | |||
| 05-07 T | Lab 2 | §6.1 | 10. File system performance | Downs et al. • Nguyen & Im • Tse et al. |
| 05-09 R | §2.5 | 11. File system design | Chen & Liu • Eng • Jutovsky & Dykstra • Morgan • Wen & Tang | |
| 05-14 T | §6.3.4 | 12. File system implementation | Nguyen et al. • Zhao et al. | |
| 05-16 R | §8.1.1, §8.2.1, §8.4.1, §9.2 (PDF), POSIX defect 672 | 13. File system robustness | Ananth Rama • Rishi & Jayant • Valente | |
| 05-17 F | Lab 3 | |||
| 05-21 T | §5.4, §6.2 intro, §6.2.3–§6.2.9 | 14. Virtual memory | Corbalis • Peng • Rhee • Takata & Lal • Tsay & Sywe | |
| 05-23 R | §4.2, §4.3 | 15. VM and processes; distributed systems | Burns • Chalman & Vong • Gotimukala & Binning • Yamashita | |
| 05-28 T | §4.5 | 16. Robustness, parallelism, and NFS | Lee & Yeo • Schoellkopf & Shoemaker • Xue | |
| 05-29 W | WeensyOS 2 | |||
| 05-30 R | §11–§11.3 (PDF), Garber 2012 | 17. Introduction to security; authentication | Berger • Kim • North • Roizen | |
| 06-04 T | Lab 4 | §11.4–§11.8 (PDF) | 18. Confidentiality, authorization, and protocols | Alquaddoomi • Rosales • Sun & Wang |
| 06-06 R | Armbrust et al. 2010, Brewer 2012 | 19. Utility computing | Fong & Seth | |
| 06-07 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.