Syllabus and general information for MCS-378: Operating Systems (Fall 2001)

Overview

• Operating systems provide the classic application domain for certain techniques that are useful in other contexts as well. In particular, concurrent programming has traditionally been been an ``operating systems'' topic, but is now quite broadly applicable. Other topics that are no longer the sole province of operating systems include resource allocation, security, and fault tolerance.
• Although most of you won't write operating systems, you'll interface with them. You may write applications programs that make use of the operating system's facilities, or contribute to the design of hardware on which the operating system runs, or find yourself educating an operating system developer about the features that would allow your web server or database system to run most efficiently. You may be a system administrator who has to configure and tune an operating system. An understanding of what goes on inside an operating system will allow you to be more effective in roles like these. You may even find yourself tacking a new feature on in some small corner of an operating system other people wrote.

Office hours

World Wide Web

Text and readings

Labs

Attendance is expected for all lab days. (If you turn in a lab report early, you are excused from the remaining days devoted to that lab.) I will excuse up to two absences per student, for any reason. Use yours wisely. If you exceed this allowance, I may reduce your course grade by one letter grade.

For each lab, I will assign you a lab group. You will work with different people each lab, and with a different person for the presentation than for any of the labs. Thus, over the semester you will work with the majority of the class.

Presentations

Each pair of students will be responsible for setting up a meeting with me the week before their presentation to go over it with me. (You are welcome to additional consultations as well.) At that meeting, you should also give me three straightforward questions about your reading. I will distribute these to the full class. All class members will turn in their answers to these three questions at the beginning of class the day of your presentation, as a way of making sure we all have a common starting point.

I will provide a list of attributes that good presentations have. For each presentation, each student in the audience will be asked to select two of these attributes that were particular strong points, and two that particularly need work. I will summarize this feedback for the presenters. I will also use the same list of attributes to structure my own evaluation of the presentation, which will take place in a face-to-face "debriefing" with the presenters, with the grade generated as a summary of that meeting.

I'm going to ask you to express a preference ranking for the topics, and will try to the extent possible to assign people to topics based on that. (You can also take into account in your preference rankings the timing of the presentations.) I'll need to have you email me the rankings by 1:15pm Thursday (September 6) so that I can make the presentation and lab group assignments in time for the lab staring Monday.

The topics are:

1. September 19: "Scalable Linux Scheduling", Stephen Molloy and Peter Honeyman, FREENIX Track: 2001 USENIX Annual Technical Conference, pp. 285-295.
2. September 21: "Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors", Abhishek Chandra, Micah Adler, Pawan Goyal, and Prashant Shenoy, 4th Symposium on Operating System Design & Implementation, 2000, pp. 45-58.
3. October 12: "The Multi-Queue Replacement Algorithm for Second Level Buffer Caches", Yuanyuan Zhou, James F. Philbin, and Kai Li, 2001 USENIX Annual Technical Conference, pp. 91-104.
4. October 23: "Storage Management for Web Proxies", Elizabeth Shriver, Eran Gabber, Lan Huang, and Christopher A. Stein, 2001 USENIX Annual Technical Conference, pp. 203-216.
5. October 24: "Single Instance Storage in Windows 2000", William J. Bolosky, Scott Corbin, David Goebel, and John R. Douceur, 4th USENIX Windows Systems Symposium, 2000, pp. 13-24.
6. November 16: "An Architecture for Content Routing Support in the Internet", Mark Gritter and David R. Cheriton, 3rd USENIX Symposium on Internet Technologies and Systems, 2001, pp. 37-48.
7. November 28: "Archipelago: An Island-Based File System For Highly Available And Scalable Internet Services", Minwen Ji, Edward W. Felten, Randolph Wang, and Jaswinder Pal Singh, 4th USENIX Windows Systems Symposium, 2000, pp. 1-12.
8. December 7: "The OSU Flow-tools Package and CISCO NetFlow Logs", Steve Romig, Mark Fullmer, and Ron Luman, 14th Systems Administration Conference, 2000, pp. 291-303.

Homework assignment policy

Normally homework problems may be turned in at any time up until the midterm exam, for those topics covered on the midterm, or the last day of classes, for the remainder. However, if we would benefit from discussing a homework problem in class, I may issue a "last call" for solutions to that problem, at least a week in advance.

Unless I indicate that a particular problem must be done individually, you may work on any problem in a group of two or three students. One copy of the solution produced by the team should be turned in, with all team members names on it. Write "we all contributed fairly to this solution" and have all team members sign under that statement.

Tests

Honor

Any substantive contribution to your solution by another person or taken from a publication should be properly acknowledged in writing. Failure to do so is plagiarism and will necessitate disciplinary action.

The same standards regarding plagiarism apply to team projects as to the work of individuals, except that the author is now the entire team rather than an individual. Anything taken from a source outside the team should be be properly cited.

One additional issue that arises from the team authorship of project reports is that all team members must stand behind all reports bearing their names. All team members have quality assurance responsibility for the entire project. If there is irreconcilable disagreement within the team it is necessary to indicate as much in the reports; this can be in the form of a ``minority opinion'' or ``dissenting opinion'' section where appropriate.

Late lab assignments

If you are too sick to complete an assignment on time, you will not be penalized. Simply write ``late due to illness'' at the top of the assignment, sign your name and hand it in. Other circumstances will be evaluated on a case-by-case basis.

Grade changes

Grading

• 40% Labs (4 @ 10% each)
• 10% Presentation
• 18% Homework (based on fraction done; see above)
• 12% Midterm
• 20% Final exam

Style guidelines

Accessibility

Syllabus

This is my best guess as to the rate at which we will cover material. However, don't be shocked if I have to pass out one or more revised syllabi.

Date	Reading	Topic	Due
9/5	1	Introduction
9/7	2	Computer-system structures
9/10		Lab 1: Scheduling experiments
9/11	3	Operating-system structures
9/12	4	Processes
9/14	5	Threads
9/17		Lab 1 (concludes)
9/18	6	CPU scheduling
9/19	paper 1	Scalable Linux Scheduling
9/21	paper 2	Surplus Fair Scheduling
9/24		Lab 2: Kernel-level experimentation	Lab 1
9/25	7.0-7.6	Process synchronization
9/26	7.7-7.10	More on process synchronization
9/28	8	Deadlocks
10/1		Lab 2 (continued)
10/5	9	Memory management
10/8		Lab 2 (continued)
10/9	10.0-10.4	Virtual memory
10/10	10.5-10.8	More on virtual memory
10/12	paper 3	Multi-Queue Replacement
10/15		Lab 2 (concludes)
10/16	11.0-11.5	File systems
10/17	11.6-11.11	More on file systems	Lab 2
10/23	paper 4	Storage Management for Web Proxies
10/24	paper 5	Single-Instance Storage
10/26		review/catch-up
10/29		Lab 3: Filesystem locality
10/30		mid-term exam
10/31	12	I/O systems
11/2	13	Mass storage
11/5		Lab 3 (continued)
11/6	14	Network structures
11/7		More on networking
11/9		More on networking
11/12		Lab 3 (continued)
11/13		More on networking
11/14		Networking case study
11/16	paper 6	Content Routing
11/19		Lab 3 (concludes)
11/20	15	Distributed communication
11/21	16	Distributed coordination	Lab 3
11/26		Lab 4: Distributed communication
11/27	17	Distributed file systems
11/28	paper 7	Archipelago
11/30		Lab 4 (continued) (a Friday lab)
12/3		Lab 4 (continued)
12/4	18	Protection
12/5	19	Security
12/7	paper 8	NetFlow Logs
12/10		Lab 4 (concludes)
12/11		Infrastructure tour
12/12		review/catch-up/evaluation	Lab 4
12/14		Final exam, 1-3pm