I will be available in my office (OHS 303) from 10:30-11:20 on Mondays, Tuesdays, Thursdays*, and Fridays, as well as by appointment. Or try your luck: just stop by and see whether my door is open. You may send me electronic mail at email@example.com or call me at extension 7466. I'll try to put any updates to my office hours on my web page, so check there if in doubt. (*Exception: on September 20th, the time will be 2:30-3:20.)
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.
Each student 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 email me their answers to these three questions by 10am the day of your presentation, as a way of making sure we all have a common starting point. I will look through them and alert you immediately before your presentation if there are any common difficulties you might want to address. No late answers will be accepted for these questions, as their point is to lay the groundwork for the presentation.
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 presenter. 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 presenter, 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 noon Monday (September 10).
Six out of the seven papers are from USENIX conferences; for these, the title links below point to the official versions on the main USENIX site. These will give you the abstracts of the papers, and for most of them even the full text. For a couple of the newer ones, the full text on the USENIX site is temporarily restricted to members; for these, you can get the full text from any on-campus location by using the link labeled "on-campus version." The one non-USENIX paper's title is directly linked to an author's copy of the paper.
Each class day (not counting lab days), you are to send me an email by 10am with your preparation assignment for that day. I will look these over in order to shape the class to meet your needs. As additional incentive, they will count for a portion of your class grade, based on how many you submit. No late preparation assignments are accepted, as that would undermine their real purpose.
For classes with a student presentation of a conference paper, the preparation assignment will consist of questions provided by the presenters, as described in the section on presentations.
For all other class days, your assignment is to send me an agenda for that day's class. Is there old business from prior days that you see as needing more time? In the new topics from that day's reading, what are the main points we should cover? What illustrations, programs, or other examples from the book would you like to go over? Are there items for which you would like a different example? If you have no particular items you want covered, you can always fall back on giving me an outline of the reading, as a last resort.
You are to select your own homework problems. Each of the eleven chapters in the textbook ends with exercises, programming projects, and exploration projects. You may submit any of these, subject to the restrictions listed below. If I indicate that your initial solution is inadequate, you can submit a revised version, as many times as are necessary to succeed. For each one you eventually succeed at, you will receive one percentage point toward your course grade, up to a maximum of 22%. Thus, your grade will be maximized if you average two successful problems per chapter. Other than that, the restrictions are as follows:
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 report; this can be in the form of a “minority opinion” or “dissenting opinion” section where appropriate.
You are expected to be familiar with the college academic honesty honor code policy and to comply with that policy. If you have any questions about it, please ask.
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.
If you have a learning, psychological, or physical disability for which a reasonable accommodation can be made, I would be happy to refer you to the college's disability services coordinator, and to cooperate in the accommodation process. It is generally best if this can be done as soon as possible.
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.
|9/11||Scheduling, Lab Preview, and Energy|
|9/13||Lab 1: Exploring Scheduling|
|9/17||Lab 1 continued|
|9/18||4.4-4.6||Other Synchronization Patterns|
|9/20||Lab 1 concludes|
|9/24||Lab 2: Deadlock Prevention||Lab 1|
|9/25||paper 1||Programming High-Performance Servers|
|9/27||5.1-5.2||Example Applications of Transactions|
|9/28||5.3-5.4||Mechanisms for Atomicity and Durability|
|10/1||Lab 2 concludes|
|10/2||No class (attend Nobel conference)|
|10/4||5.5-5.6||Additional Transaction Mechanisms||Lab 2|
|10/5||paper 2||Software Transactional Memory|
|10/8||Review||HW rewrites (1-5)|
|10/9||Intra-term exam 1|
|10/11||6.1-6.2||Uses for Virtual Memory|
|10/12||6.3||Mechanisms for Virtual Memory|
|10/15||6.4-6.5||Policies for Virtual Memory|
|10/16||Lab 3: Prepaging Performance|
|10/18||paper 3||Virtual Memory and Garbage Collection|
|10/19||Lab 3 Continues|
|10/22||No class (reading day)|
|10/23||No class (reading day)|
|10/25||7.1-7.2||POSIX Process Management|
|10/29||Lab 3 Concludes|
|10/30||paper 4||Software-based Fault Isolation|
|11/1||8.1-8.3||POSIX File API|
|11/2||8.4-220.127.116.11||Disk Space Allocation||Lab 3|
|11/5||18.104.22.168-8.6||Metadata, Directories, and Indexes|
|11/6||Lab 4: Programming a Shell|
|11/9||Lab 4 continues|
|11/12||paper 5||Exernal Synchrony|
|11/13||Review||HW rewrites (6-8)|
|11/15||Intra-term exam 2|
|11/20||Lab 4 concludes|
|11/22||No class (Thanksgiving)|
|11/23||No class (Thanksgiving)|
|11/26||More on Networking|
|11/27||paper 6||Robustness of BitTorrent Incentives|
|11/29||10.1-10.3||Messaging and Remote Method Invocation||Lab 4|
|12/4||Lab 5: Communication Middleware|
|12/7||Lab 5 continues|
|12/10||Lab 5 concludes|
|12/11||11.5-11.8||More on Security|
|12/13||paper 7||Dynamic Spyware Analysis|
|12/14||Review and evaluation||Lab 5, HW rewrites (9-11)|