Course Identification

Title:

Distributed Network Algorithms

Code:

20194061

Lecturers and Teaching Assistants

Lecturers:

Prof. David Peleg

TA's:

N/A

Course Schedule and Location

Year:

2019

Semester:

First Semester

When / Where:

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

First Lecture:

05/11/2018

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points

Comments

N/A

Prerequisites

No

Restrictions

Participants:

97

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

10/02/2019

Location

Ziskind, Rm 155

Time

1100-1300

Remarks

N/A

Scheduled date 2

Date / due date

10/03/2019

Location

Ziskind, Rm 155

Time

0900-1100

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

1

Syllabus

The course will cover basic topics in the theory of distributed network algorithms. The material to be covered includes: Basic (deterministic and randomized) distributed network algorithms, communication paradigms, resource sharing, synchronization and coordination.

Learning Outcomes

Upon successful completion of this course students should be able to:

Describe the key notions and principles of distributed computing theory.
Demonstrate familiarity with basic paradigms and algorithmic techniques of the field of distributed network algorithms.
Solve some of the central problems in the area of Distributed Network Algorithms.
Discuss modern research in the field of Distributed Network Algorithms.

Reading List

N/A

Website

N/A