Course Identification

Title:

Fault Tolerant Distributed Computing

Code:

20194042

Lecturers and Teaching Assistants

Lecturers:

Prof. David Peleg

TA's:

N/A

Course Schedule and Location

Year:

2019

Semester:

Second Semester

When / Where:

Monday, 09:15 - 11:00, Ziskind, Rm 1

First Lecture:

25/03/2019

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points

Comments

N/A

Prerequisites

No

Restrictions

Participants:

93

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Final:

100%

Evaluation Type

Examination

Scheduled date 1

Date / due date

17/07/2019

Location

Ziskind, Rm 1

Time

0900-1100

Remarks

N/A

Scheduled date 2

Date / due date

05/09/2019

Location

Ziskind, Rm 1

Time

0900-1100

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

1

Syllabus

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.

Learning Outcomes

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.

Reading List

N/A

Website

N/A