CPS 310: Operating Systems (also ECE 353) Spring 2018
home calendar topics work resources
Class Meetings
WF 3:05 - 4:20 in B101 LSRC [Panopto]
M 3:05 - 4:20 in B101 LSRC (Recitation)
Jeff Chase (chase@cs.duke.edu)
Office hours: Tues 11:00 and Th 2:00 in D306 LSRC, or after class, or by appointment, or try a drop-in.
Teaching Assistant
Waqar Aqeel, Office hours: Wed 12:00 - 2:00 (North Building, ground floor, room 6)
Siddhartha (Sid) Nalluri, Office hours: Sun 7:00 - 9:00 PM (Languages 211)
8 great UTAs
U/TA Office hours

Course announcements

  • Optional final exam Saturday May 5, 9AM-noon.
  • Midterm #2 solution: [PPTX, PDF]
  • A little bit of storage: I/O and caching (4/25) [PPTX, PDF]
  • Service performance and scale (4/20) [PPTX, PDF]
  • Crypto and applications (4/13-18) [PPTX, PDF]
  • RPC and Android (4/11) [PPTX, PDF]
  • The RAFT paper [PDF]
  • Distributed systems and consensus replication (3/28-30) [PPTX, PDF]
  • Identity, authorization, and trust (3/21-23) [PPTX, PDF]
  • The hacker lab is due on 3/26.
  • Midterm #1 solution [PPTX, PDF].
  • Stack smashing (recitation 3/19) [PPTX, PDF]
  • Unix: process tree (3/7, 3/21) [PPTX, PDF]
  • Unix: the basics (3/2, 3/7) [PPTX, PDF]
  • Servers, sockets, networking, and concurrency (2/23, 2/28) [PPTX, PDF]
  • Building synchronization (2/16, 2/21) [PPTX, PDF]
  • Some p1t notes (Recitation 2/12) [PPTX, PDF]
  • Concurrency (2/7-9) [PPTX, PDF]
  • Threads (Recitation 2/5) [PPTX, PDF]
  • Threads (2/2) [PPTX, PDF]
  • The kernel (1/31) [PPTX, PDF]
  • Where's my stuff? (Recitation 1/29) [PPTX, PDF]
  • Memory management (1/26) [PPTX, PDF]
  • Memory and the heap (1/19, 1/24) [PPTX, PDF]
  • Intro slides [PPTX, PDF]
  • Know the course policies!
  • Syllabus [PDF].

See links below to get started:

Anonymous feedback: You may use this link to send anonymous feedback on any Duke CPS course, including this one. Your comments are visible to the instructor, CPS Director of Undergraduate Studies, and CPS Chair.

This course gives an introduction to systems concepts and operating systems. Traditionally the course emphasizes classical operating systems topics: concurrency, facilities for storage, communication, and protection, kernel services and structure, architecture/OS interaction, distributed systems, and practical application of operating system concepts in real operating systems. We also explore the nature of "systems" as an evolving discipline encompassing all aspects of bridging the gap between applications and hardware.

More broadly, an operating system is software that controls some programmable platform for sharing resources and data. All operating systems must deal with core issues of protection, resource management, program environment and execution, coordination, and reliable state storage and recovery. Various programming systems ranging from cloud services to Web frameworks to programmable networks to browsers meet our definition of a "programmable platform". About half the course focuses on classical OS topics; the other half covers other principles and topics that are important for understanding modern networked software ecosystems.

The prerequisites for this course are introductory programming and basic computer architecture (e.g., CPS 250). The intended audience is computer science undergraduates and graduate students needing a background in systems. Welcome to the Machine [PDF] is a quick-and-dense overview of relevant computer architecture: if it mostly makes sense to you, then you'll be OK. You should take time to review any unfamiliar topics or terms discussed in that document.

There is no required textbook. Several texts are available and may be worth the investment: see the intro lecture notes. Operating Systems in Three Easy Pieces (OSTEP) is an excellent resource for at least the first half of the course. There is lots of useful material in the classic computer systems textbook Bryant/O'Hallaron CS:APP.

More course policies
Exam FAQ about exams in this class
Exam archive