Fault Tolerant Distributed Computing
Lecturers and Teaching Assistants
Prof. David Peleg
Course Schedule and Location
Wednesday, 10:15 - 12:00, Ziskind, Rm 155
Field of Study, Course Type and Credit Points
Mathematics and Computer Science: Lecture; Elective; Regular; 2.00 points
Attendance and participation
Scheduled date 1
Scheduled date 2
Estimated Weekly Independent Workload (in hours)
The course will cover basic topics in the theory of fault tolerant distributed computing. The material to be covered includes lower bounds, impossibility results and deterministic and randomized fault-tolerant algorithms for problems such as information dissemination, consensus and coordinated attack, in various fault models.
Upon successful completion of this course student should be able to:
- Describe the key notions and principles of fault-tolerance in distributed computing theory.
- Explain basic paradigms and algorithmic techniques of the field of fault-tolerant distributed algorithms.
- Solve central problems in the field.
- Discuss modern research in the field.