Remember to check this regularly!
ProfessorFabián E. Bustamante
Technological Institute, L477
+1 847 491-2745
Ford Design Building, 2-208
Location and Time
Lectures: Mondays and Wednesdays 11:00-12:20PM
Professor Office Hours: by appointment
TA Office Hours: Wednesdays 4-6 in office or adjacent lounge
Final Exam: Wed June 7, 7-9PM (According to the registrar; we may look for an alternative time!) (in the classroom)
Distributed systems are collections of networked computers that coordinate their actions through message exchanges. Most computing systems you interact with everyday are indeed distributed (e.g. email, web, Google, Skype, Facebook ...) for a variety of reasons such as fault tolerance, performance, and the geographical nature of the requirements.
In this course, we will discuss some of the basic principles behind distributed systems as well as common approaches and techniques used to build them. We illustrate these ideas through case studies of widely used or seminal systems.
- EECS-343 Operating Systems (or equivalent)
- EECS-340 Introduction to Networking.
- (Please contact me if you do not meet some of these requirements.)
There are a number of communication channels set up for this class:
- We will use the course web site to post announcements related to the course. You should check this regularly for schedule changes, clarifications and corrections to assignments, and other course-related announcements.
- We will use Piazza for class discussion. The system is highly catered to getting you help fast and efficiently from classmates, the TA, and myself. Rather than emailing questions to the teaching staff, I encourage you to post your questions on our Piazza for DS
- There is always email for questions that would be inappropriate to post on the newsgroup/discussion-board. When using email to contact the staff please start your subject line with "eecs345: helpful-comment" to ensure a prompt response.
The course is organized as a series of lecture and paper discussions, four projects and a take home exam.
- Lectures - A set of lectures on the core of the material.
- Readings - Textbook and paper reading in preparation for (not substitution of) the lecture.
- Homework assignments - A set of assignments meant as reader enforcers.
- Projects - Four programming projects to give you a better understanding of the subject matter and experience with the Go programming language.
- A final exam.
I use a criterion-referenced method to assign your grade; in other words, your grade will be based on how well you do relative to predetermined performance levels, instead of in comparison with the rest of the class. Thus, if a test has 100 possible points, anyone with a score of 90 or greater will get an A, those with scores of 80 or greater will get a B, those with scores of 70 or greater will get a C, and so on. Notice that this means that if everyone works hard and gets >90, everyone gets an A.
Total scores (between 0 and 100) will be determined, roughly, as follows:
- Homework assignments 15% (+5% extra paper-related questions)
- Class participation 10%
- Projects 50%
- Exam 25% (+5% extra on paper-relatex questions)
Unless otherwise indicated, homework assignments and projects are due by midnight on their due date. If you hand in an assignment late, we will take off 10% for each day (or portion thereof) it is late. Assignments that are three or more days late receive no credit.
Cheating vs. Collaboration:
Collaboration is a really good thing and we encourage it. On the other hand, cheating is considered a very serious offense. When in doubt, remember that it's OK to meet with colleagues, study for exams together, and discuss assignments with them. However, what you turn in must be your own (or for group projects, your group's own) work. Copying code, solution sets, etc. from other people or any other sources is strictly prohibited.
- Networking and Internetworking
- Remote invocation and indirect communication
- Overlay networks and P2P
- Distributed file systems
- Name services
- Time and global state
- Coordination and agreement
- Consistency and replication
The following is our intended calendar with topics, slides (as they become available) and reference material. Note "CDKB5 #" refers to chapters of the class' textbook (Coulouris et al.,
Distributed Systems: Concepts and Design, 2012). Also, papers tagged as [Q] may be part of homework assignment/finals questions References:
Networking and Internetworking I [pdf]
Networking and Internetworking II [pdf]
Go, Go [pdf] [tutorial.tgz]
Communication I [pdf]
Communication II [pdf]
Overlay Networks [pdf]
Distributed File Systems 1[pdf]
Distributed File Systems 2 [pdf]
Name Services [pdf]
Content distribution networks [pdf]
Time and Synchronization [pdf]
Coordination I [pdf]
Global State [pdf]
Coordination II [pdf]
Replication and Fault Tolerance [pdf]
Mobile and Ubiquitous [pdf]
There are some basic homework assignments, mostly meant as reading eforcers, and warmup project and three team projects that build on each other.
We will post all asignments in the Canvas' site for the course.
|1: Introduction - Overlays||04/13||04/20|
|2: Distributed file systems - Content distribution||04/27||05/04|
|3: Time, Coordination and Global Snapshot||05/09||05/16|
|4: Consensus - Replication||05/23||05/30|
The first project for this course is a short, one-week long project meant to serve as a gentle introduction to Go and a quick way to check if you are ready to take on the rest. The following three projects implement a basic DHT (Distributed Hash Table) and build upon it in some interesting way. All projects are to be done in teams of 2-3 students (1 is not allowed), to
All projects will be done in Go, a language that was originally created within Google, but is now a fully open-source project. Go is garbage-collected and has built-in coroutines (called goroutines) and channels, making it highly suited to building distributed systems. Its standard library is already pretty comprehensive. For example, take a look at the net and rpc packages.
|Project 0: NU Chitter||04/03||04/14|
|Project 1: Kademlia DHT Part 1||04/19||04/28|
|Project 2: Kademlia DHT Part 2||05/01||05/12|
|Project 3: Vanish||05/18||06/01|
We will be reading two or more paper per week; you should have read the assigned paper before coming to lecture.
When reading papers it is useful to write down a summary of about a page. Your summary should include at least:
- Paper title and its author(s).
- Brief one-line summary.
- A paragraph of the most important ideas: perhaps a combination of their motivations, observations, interesting parts of the design, or clever parts of their implementation.
- A paragraph of the largest flaws; maybe an experiment was poorly designed or the main idea had a narrow scope or applicability. Being able to assess weaknesses as well as strengths is an important skill for this course and beyond.
- A last paragraph where you state the relevance of the ideas today, potential future research suggested by the article, etc.
You may find the following documents useful:
- How to Read a Paper by S. Keshav, ACM SIGCOMM CCR, 37(3), 2007.
- Efficient reading of papers in Science and Technology by Michael J. Hanson, 1990, revised 2000 Dylan McNamee.
- George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Bair, Distributed Systems: Concepts and Design.Pearson, 5th Ed., 2012 ("CDKB5").
- A set of research papers I will make available (see the schedule page for a full list).
- S. Keshav, How to Read a Paper, ACM SIGCOMM CCR, 37(3), 2007.
- Michael J. Hanson, Efficient reading of papers in Science and Technology, 1990 (revised 2000 Dylan McNamee).
- Roy Levin and David D. Redell, An evaluation of the ninth SOSP submissions -or- How (and how not) to write a good systems paper, ACM SIGOPS Operating Systems Review 17(3):35-40 (Jul., 1983)
- George D. Gopen and Judith A. Swan,The Science of Scientific Writing,American Scientist (Nov-Dec 1990), 78: 550-558.