Distributed Systems (HS 2019)
Note: This course is part of the course "Computer Systems" (252-0217-00L). Visit the page of the full course held together with Professor Roscoe here.
This course introduces the fundamentals of distributed systems. We study different protocols and algorithms that allow for fault-tolerant operation, and discuss practical systems that implement these techniques. The objective of the course is for students to understand the theoretical principles and practical considerations of distributed systems. This includes the main models of fault-tolerant distributed systems (crash failures, byzantine failures, and selfishness), and the most important algorithms, protocols and impossibility results. By the end of the course, students should be able to reason about various concepts such as consistency, durability, availability, fault tolerance, and replication.
Topics: client-server, serialization, two-phase protocols, three-phase protocols, paxos, two generals problem, crash failures, impossibility of consensus, byzantine failures, agreement, termination, validity, byzantine agreement, king algorithm, asynchronous byzantine agreement, authentication, signatures, reliable and atomic broadcast, eventual consistency, blockchain, cryptocurrencies such as bitcoin and ethereum, proof-of-work, proof-of-*, smart contracts, quorum systems, fault-tolerant protocols such as piChain or pbft, distributed storage, distributed hash tables, physical and logical clocks, causality, selfishness, game theoretic models, mechanism design.
Course pre-requisites: None.
Course language: English.
Lecture by Roger Wattenhofer, Monday or Friday 10.15-12.00 @ CAB G 61.
Exercises by Rösti André, Friday 13.15-15.00 @ CAB G 57. Exercises only take place in the weeks with a lecture.
Organization by Roland Schmid.
Project Work: There will be a project during the semester, through which a quarter grade bonus can be earned. Click here for details.
Word of advice from the professor: Instead of coming to this course, you can also just read The Saddest Moment by James Mickens, the guy who continuously tried to convince me that having vodka shots at a local Denny's at 3am is how I should spend my nights. Just reading Mickens will not give you any credits though.
News
21.10.2019 | Updated the lecture schedule. |
31.10.2019 | Extended the 1st bonus submission deadline to Sunday, 3rd of November, 11:59pm. New submission link (only in case the old link did not work for you): https://polybox.ethz.ch/index.php/s/rGylCwHNwP5ZMBy |
05.11.2019 | Updated Chapter 16: Simplified Algorithm 16.15. |
11.11.2019 | Updated Chapter 17: Uploaded complete version from the lecture. In particular, added Section 17.6. |
15.11.2019 | Updated Chapter 17: Updated Section 17.6. |
15.11.2019 | Updated Chapter 18: Simplified Algorithms 18.11 and 18.14, updated Algorithm 18.18 and Theorem 18.19. Note that we moved Definition 18.1 (Shared Coin) to this chapter. Thus, the numbering has changed. |
17.01.2020 | Added material from the Q&A session. |
10.02.2020 | This year's exam and a sample solution have been uploaded. |
14.02.2020 | There will be two exam review sessions in the room ETZ G 88:
|
Lecture Material
Lecture material and exercise sheets will be uploaded here as the lecture progresses. Note that chapter numbers are aligned with the course "Computer Systems".
Title | Lecture Notes | Exercises | Additional Material |
---|---|---|---|
Chapter 14 Introduction 2019-10-28 (Monday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 15 Fault Tolerance & Paxos 2019-10-28 (Monday) |
PDF PDF 2-on-1 |
Exercises Solutions |
--- |
Chapter 16 Consensus 2019-11-01 (Friday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 17 Byzantine Agreement 2019-11-11 (Monday) |
PDF (with Section 17.6) PDF 2-on-1 |
Exercises Solutions |
--- |
Chapter 18 Broadcast & Shared Coins 2019-11-15 (Friday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 19 Consistency & Logical Time 2019-11-18 (Monday) |
PDF PDF 2-on-1 |
Exercises Solutions |
--- |
Chapter 20 Time, Clocks & GPS 2019-11-22 (Friday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 21 Quorum Systems 2019-11-25 (Monday) |
PDF PDF 2-on-1 |
Exercises Solutions |
--- |
Chapter 22 Eventual Consistency & Bitcoin 2019-11-29 (Friday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 23 Game Theory 2019-12-02 (Monday) |
PDF PDF 2-on-1 |
Exercises Solutions |
--- |
Chapter 24 Distributed Storage 2019-12-06 (Friday) |
PDF PDF 2-on-1 |
--- | --- |
Chapter 25 Authenticated Agreement 2019-12-09 (Monday) |
PDF PDF 2-on-1 |
Exercises Solutions |
No Consensus Slides No Consensus Paper |
Chapter 26 Advanced Blockchain 2019-12-13 (Friday) |
PDF PDF 2-on-1 |
--- |
Rational Blockchain Slides Rational Blockchain Paper |
Chapter 27 Blockchain Research 2019-12-16 (Monday) |
--- | --- |
Lightning & Outpost Slides Outpost Paper Payment Channels Slides Cerberus Channels Paper Brick Paper Byzantine Preferential Voting Slides Byzantine Preferential Voting Paper |
Chapter 28 Q&A on Distributed Systems 2019-12-20 (Friday) |
--- | --- |
piChain Slides piChain Paper Summary |
References
[BCS] | Blockchain Science: Distributed Ledger Technology Roger Wattenhofer Inverted Forest Publishing, 2019, ISBN 978-1793471734 |
Exam Preparation
The written exam takes place on Saturday, January 25th, in HIL E 1. It lasts 90 minutes and no written or electronic aids are permitted.
All material covered by lectures and exercises may be tested in the exam. We did not discuss Sections 19.4, 19.5, and 26.5, so the content of these sections is not part of the exam. We did not discuss some of the hypercubic networks (24.12-24.16), and we only discussed the f-opaque quorum system (21.4) on a high level.
Do not memorize the details of the remarks (e.g., what year UTC was established, or how the UTC format looks like; but you should know that UTC exists). Also, there is no need to learn all details of the algorithms and proofs. However, you should understand their concepts and ideas, so that you could explain them, or discuss variants.
To get an idea for the style of questions in the exam, you may consult exams from previous years: HS09, HS10, HS11, HS12, HS13, HS14, HS15, HS16, HS18. Beware that the topics covered have shifted around a little over the years, so some older exams have questions about topics that are not in the lecture anymore. Some of the older exams are in German, but this year’s exam is in English.
A Q&A session will be held on Friday, January 17th, at 1pm in ETF E 1. We will not answer questions after the Q&A session anymore.
Important: You need to submit your questions no later than 72 hours prior to the session to give the responsible assistants enough time to find satisfying answers to your questions. That is, the deadline for submitting questions is Tuesday, January 14th, 13:00. Please submit your questions here. If you only bring up your questions in the Q&A session, we cannot guarantee having answers for you.
Please keep in mind that this Q&A session will cover only the Distributed Systems part of the lecture.
The questions and answers from the Q&A session are available here.
This Year's Exam
For your nostalgic and enlightening pleasure, we have made this year's exam available here. Please note, that the sample solution merely contains a single correct solution for each task which would have netted full points, but other solutions may also have received partial or full points.