VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

251-0336-00L 5 Credits

Principles of Distributed Computing

VVZ CR n/a

Last Updated: 2026-02-05 15:02:43

Abstract

This course introduces the basics of distributed computing, highlighting common themes and techniques. We study the fundamental issues underlying the design of distributed systems: communication, coordination, synchronization, uncertainty, locality. We explore essential algorithmic ideas and lower bound techniques.

Objective

In the last two decades, we have experienced an unprecedented growth in the area of distributed systems and networks; distributed computing now encompasses many of the activities occurring in today's computer and communications world. This course introduces the basics of distributed computing, highlighting common themes and techniques. We study the fundamental issues underlying the design of distributed systems communication, coordination, synchronization, uncertainty, and essential algorithmic ideas and lower bound techniques. One of the main themes of recent research in distributed algorithms is "locality" (also known as decentralized computing, or peer-to-peer computing). Networks grow fast, thus locality and scalability become first-class issues. We discuss some of the most fascinating local distributed algorithms in the second part of the course.

Content

Introduction, Vertex Coloring, Leader Election, Tree Algorithms, Routing, Basic Network Topologies, Routing Strikes Back, Shared Variables, Sorting, Graph Algorithms. For more details, please see the web page of the course.

Resources

Lecture Notes

Available, please see course web page.

Literature

- Hagit Attiya and Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill 1998. - David Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications 2000. - Frank Thomson Leighton: Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, 1991.

Learning Materials (Links)

General Information

Language
English
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 90 minutes
Aids
Keine

Course Components

Type Title Time & Place Hours
lecture Principles of Distributed Computing
  • Wed 08:15-10:00 (RZ F 21)
2 h weekly
exercise Principles of Distributed Computing
  • Wed 10:15-12:00 (RZ F 21)
1 h weekly

Offered In