CS262: Advanced Topics in Operating Systems

Prof. Eric A. Brewer
WF 11-12:30 in 310 Soda (CCN 25139)



Project Form

Handouts


Reading List

W 8/26 The UNIX Time-Sharing System
Dennis M. Richie and Ken Thompson
(New electronic version)
F 8/28 Entrance Exam
W 9/2 A Fast File System for UNIX
McKusick, Joy, Leffler and Fabry
Measurements of a Distributed File System
Baker, Hartman, Kupfer, Shirriff and Ousterhout (409K)
F 9/4 The Design and Implementation of a Log-Structured File System
Rosenblum and Ousterhout (229K)

The HP AutoRAID Hierarchical Storage System Wilkes, Golding, Staelin and Sullivan

W 9/9 Serverless Network File Systems
Anderson, Dahlin, Neefe, Patterson, Roselli and Wang
F 9/11 Disconnected Operation in the Coda File System
Kistler and Satyanarayanan
[PDF Version]
W 9/16 Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures
Rashid, Tavanian, Young, Golub, Baron, Black, Bolosky and Chew
Don't worry about the details of the calls.
F 9/18 Multics General Information
Multics Features
Multics Virtual Memory -- Tutorial and Reflections
Paul Green
[PostScript version with paragraph numbers (153K)]
W 9/23 Virtual Memory Primitives for User Programs
Appel and Li
F 9/25 Application-Controlled Physical Memory using External Page-Cache Management
Harty and Cheriton
Lightweight Recoverable Virtual Memory
F 10/2 Disco: Running Commodity Operating Systems on Scalable Multiprocessors
Bugnion, Devine and Rosenblum
W 10/7 The x-Kernel: An Architecture for Implementing Network Protocols
Hutchinson and Peterson
F 10/9 Active Messages: A Mechanism for Integrated Communication and Control
von Eicken, Culler, Goldstein, and Schauser

U-Net: A User-Level Network Interface for Parallel and Distributed Computing
Basu, Buch, Vogels, and von Eicken

W 10/14 How to Get Good Peformance from the CM-5 Data Network
Brewer and Kuszmaul
Congestion Avoidance and Control
Van Jacobson
F 10/16 A secure environment for untrusted helper applications: confining the wily hacker
Ian Goldberg, David Wagner, Randi Thomas, and Eric A. Brewer.
The Protection of Information in Computer Systems
Jerome Saltzer and Michael Schroeder. Just read the opening and section I (Basic Principles).
W 10/21 Extensible Security Architectures for Java
Reflections on Trusting Trust
Ken Thompson Turing Award Lecture. You do not have to summarize this paper.
Basic Flaws in Internet security and Commerce
You do not have to summarize this paper.
F 10/23 Lottery Scheduling: Flexible Proportional-Share Resource Management
Waldspurger and Weihl
Scheduler Activations Now Online!
Tom Anderson, Brian Bershad, Ed Lazowska and Hank Levy
F 10/30 Experience with Processes and Monitors in Mesa
Butler Lampson and David Redell
W 11/4 Extensibility, Safety and Performance in the SPIN Operating System
Bershad et al.
F 11/6 Application Performance and Flexibility on Exokernel Systems
Kaashoek et al.
W 11/11 [Nemesis:] The Design and Implementation of an Operating System to Support Distributed Multimedia Applications
Leslie et al.
F 11/13 Free Transactions with Rio Vista
Lowell and Chen.
We will also cover the postponed Lightweight RVM paper
W 11/18 Guest lecture: Armando Fox. Cluster-Based Scalable Network Services
(TBA) No paper summary required.
F 11/20 Guest lecture: John Kubiatowicz on Shared-Memory Multiprocessors
Reading TBA
W 11/25 Ubiquitous Computing (from Scientific American)
Mark Weiser (no summary required)
A Network Architecture for Heterogeneous Mobile Computing
Brewer, Katz et al.

Project Information

Past Projects

These are from various systems classes just to give a feel for the scope. The first one later appeared in ASPLOS, the second won best paper at the Usenix Security conference.


Slides

Note on the "[notes]" -- These are scans of handwritten notes taken (graciously) by Amoolya Singh. They correspond to the actual class discussion and are intended simply to augment student's own notes. The primary notes are typically more self-contained.


Entrance Exam

There will be an entrance exam in class on Friday August 28th. It is pass/fail, covers only undergrad OS, and should not be difficult if you've had an undergrad OS class (such as CS162). The test has no effect on grades other than admission to the class.


Brewer@cs.berkeley.edu