Syllabus for UCLA Computer Science 111, Winter 2013.
Operating Systems Principles

Text

Lectures

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 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
01-07 M 1. IntroductionMallare & ShinShahSu et al.Zhao et al.
01-09 W §1, §2–§2.3 2. Abstractions and bootstrappingGuo & YingKwan et al.Mauricio & Salehpour
01-14 M §4–§4.1.2, §5–§5.1, §5.3 3. Modularity and virtualizationHong et al.Jia et al.Zhang
01-15 T Lab 1a
01-16 W §5.5 4. OS organizationChan & LoJarecki & RenWongYu & Chen
01-23 W 5. Orthogonality, processes, and racesChiou & NgKuoLi & DaiMartinez & EdelmanShih & Ketenjian
01-25 F WeensyOS 1
01-28 M §5.2 (except §5.2.5) 6. Signals, scheduling, and threadsBao et al.Chen & DeCosteHuang & Phillips
01-29 T Lab 1b
01-30 W §6.3–§6.3.3 7. Scheduling algorithmsHao et al.Hui et al.
02-01 F Lab 1c
02-04 M §9.1.2–§9.1.7 (PDF) 8. Consistency; critical sectionsBrown et al.Mercer et al.
02-06 W §5.2.5, §5.6 9. Synchronization primitives; deadlockno volunteers
02-11 M midterm, in lecture
02-13 W Lab 2 §6.1 10. File system performance Fang et al.LinLopez & RodriguezShkel & Grair
02-20 W §2.5 11. File system design Chang et al.Lung & JainPham et al.Wei
02-25 M §6.3.4 12. File system implementation Brett & HaugenJiang et al.Navarro et al.
02-27 W Lab 3 §8.1.1, §8.2.1, §8.4.1, §9.2 (PDF) 13. File system robustness AbuelChaldez & NunezChernKim & SunPhamRaveendran & MaoWang
03-04 M §5.4, §6.2 intro, §6.2.3–§6.2.9 14. Virtual memory BotrosChanGonzalez & OrtegaLiao et al.SituTowe
03-06 W §4.2, §4.3 15. VM and processes; distributed systems BoyleNathani et al.LiangOhSnively & LehmanYu & LuYuan & Lewe
03-08 F WeensyOS 2
03-11 M §4.5 16. Robustness, parallelism, and NFSChuang & WeiRiceTaiTam
03-13 W Lab 4 §11–§11.8 (PDF), Garber 2012 17. Introduction to securityBaldonadoChao & Khau
03-15 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).

Final exam

The final exam is three hours and will be held at the time scheduled by the registrar.


© 2004, 2007–2010, 2012–2013 Paul Eggert. See copying rules.
$Id: syllabus.html,v 1.84 2013/03/19 02:04:27 eggert Exp $