About
In a world where clusters with thousands of nodes are becoming commonplace, we are often faced with the task of having them coordinate and share state. As the number of machines goes up, so does the probability that something goes wrong: a node could temporarily lose connectivity, crash because of some race condition, or have its hard drive fail.
What are the challenges when designing fault-tolerant distributed systems, where a cluster is able to survive the loss of individual nodes? In this lecture, we will discuss some basics on this topic (consistency models, CAP theorem, failure modes, byzantine faults), detail the raft consensus algorithm, and showcase an interesting example of a highly resilient distributed system, bitcoin..
0:00:00 Slide 1
0:00:42 Slide 2
0:01:00 Slide 3
0:01:04 Slide 4
0:02:19 Slide 5
0:03:40 Slide 6
0:04:08 Slide 7
0:04:18 Slide 8
0:05:11 Slide 9
0:06:54 Slide 10
The talk
Credits and licence
- Institution
- CERN
- Department
- inverted CSC
- Speaker
- Georgios Bitzes
- Year
- 2017
- Language
- English
- Subjects
- Computer science
- Source
- CERN
- Licence
- CERN, as CERN states it. CERN's terms
- Attribution
- © CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
- Who can watch
- CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed