|Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau|
Operating Systems: Three Easy Pieces
Version 0.91 (Available free online! You can also click the chapters in the schedule below)
This course covers the principles of operating systems. It emphasizes the basic concepts of OS kernel organization and structure, processes and threads, concurrency and synchronization, memory management, file systems, and communication. It is also a project course, providing essential experience in programming with concurrency, implementing and unmasking abstractions, working within an existing complex system, and collaborating with other students in a group effort.
The course is organized as a series of lectures by the instructor, discussion sections by the TAs, reading, homework, and project assignments, and exams:
The course will have roughly four homeworks. I will post them as the quarter progresses. Due to extensive copying on homeworks in the past, I have changed how homeworks are graded. As long as you submit a technical answer related to the question, you will get full credit for the question. The goal of the homeworks is to give you practice learning the material. The homework questions both supplement and complement the material from lecture and in the project, and you will also find the homework questions to be useful for practicing for the exams. We will post solutions to all homeworks after they are submitted, and you can use them for studying as well. But, even with the solutions, the amount you learn from the homeworks will be directly correlated with your effort working on them.
Homeworks are due at the beginning of class (1st session) on the day specified. We will reduce homework grades by 20% for each day that they are late (end of class is considered late).
I encourage you to collaborate on the homeworks: You can learn a lot from your fellow students. Collaboration consists of discussing problems with other students and independently writing your own answers to the problems based upon those discussions. As a rule of thumb, you should be able to discuss a homework problem in the hall with others, go home, and then write up your answer to the problem on your own. Do not copy from the answers by other students, copy from past homeworks and/or solutions from previous versions of the class, copy from solutions on the Web, etc.
The course has one tutorial project and three programming projects
using the Nachos instructional operating system. We will be
coordinating the projects across both sections of CSE 120 this
Discussion sections answer questions about the lectures, homeworks, projects, and programming environment. They may also supplement the lectures with additional material.
Your grade for the course will be based on your performance on the homeworks, midterm and final exams, and the three projects using the following weights:
honesty guidelines outlined by Charles Elkan apply to this course.
I urge you to resist any temptation to cheat, no matter how desperate
the situation may seem. If you are in circumstances that you feel
compel you to cheat, come to me first before you do so.
Course Schedule (Tentative)
The following table outlines the schedule for the course. We will update it as the quarter progresses.
Lecture slides will be available in Piazza under resources.
|9/27||Course Intro||Chapter 1, Chapter 2|
|10/2||OS Architectural Support||Chapter 6||Homework 1: Out||Project 0: Out|
|10/4||Processes||Chapter 4, Chapter 5|
|10/9||Threads||Chapter 26, Chapter 27||Project 0: Due
Project 1: Out
|10/11||Synchronization||Chapter 28, Chapter 29||Homework 1: Due
Homework 2: Out
|10/16||Semaphores and Monitors||Chapter 30, Chapter 31|
|10/18||Java Threads, Synchronization Exercise||Chapter 30, Chapter 31|
|10/23||Scheduling||Chapter 7, Chapter 8|
|10/25||Deadlock, Midterm Review||Chapter 32|
|10/26||(Friday)||Homework 2: Due||Project 1: Due|
|10/30||Midterm Exam||Project 2: Out|
|11/1||Memory Management||Chapter 15, Chapter 16, Chapter 18||Homework 3: Out|
|11/6||Multiple-level Page Table, TLB||Chapter 19, Chapter 20|
|11/8||Page Replacement||Chapter 19, Chapter 20|
|11/13||Advance Memory Topics, File System||Chapter 21, Chapter 22, Chapter 23|
|11/15||File Systems (Continue)||Chapter 37, Chapter 39, Chapter 40||Homework 3: Due
Homework 4: Out
|11/20||Distributed Systems||Project 2: Due
Project 3: out
|11/22||Thanksgiving Holiday||Thanksgiving||Food. Lots of it.||Sleep. Lots of it.|
|11/27||Lecture cancelled, work on your project||Chapter 37, Chapter 39, Chapter 40|
|11/29||Big Data (Mapreduce, Hadoop)|
|12/6||Final Review||Homework 4: Due|
|12/12||Wednesday Session A Final Exam||Project 3: Due|
|12/14||Friday Session B Final Exam|
E. W. Dijkstra, The Structure of the 'THE'-Multiprogramming System, Communications of the ACM, Vol. 11, No. 5, May 1968, pp. 341-346.
(Additional historical background on semaphores in Wikipedia)
D. M. Ritchie and K. Thompson, The UNIX Time-Sharing System, Communications of the ACM, Vol. 17, No. 7, July 1974, pp. 365-375.
C. A. R. Hoare, Monitors: An Operating System Structuring Concept, Communications of the ACM, Vol. 17, No. 10, October, 1974, pp. 549-557.
Blaise Barney, POSIX Threads Programming, Lawrence Livermore National Laboratory.
Andrew D. Birrell, An Introduction to Programming with Threads, DEC SRC Research Report 35, January 6, 1989.