Distributed Network Algorithms
Lecturers and Teaching Assistants
Prof. David Peleg
Course Schedule and Location
Monday, 09:15 - 11:00, Ziskind, Rm 1
Field of Study, Course Type and Credit Points
Mathematics and Computer Science: Lecture; Elective; 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 distributed network algorithms. The material to be covered includes: Basic (deterministic and randomized) distributed network algorithms, communication paradigms, resource sharing, synchronization and coordination.
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.