Distributed Algorithms (Lecture)

Instructors: Fernando Pedone

Academic Programs: Master of Science in Informatics

Workload: 6 ECTS

Description

Distributed computing systems arise in a wide range of modern applications. This course surveys the foundations of many distributed computing systems, namely, the distributed algorithms that lie at their core. The course provides the basis for designing distributed algorithms and formally reasoning about their correctness. It addresses issues related to what distributed systems can and cannot do (i.e., impossibility results) in certain system models. The course focuses on three aspects of distributed computing: system models, fundamental problems in distributed computing, and application of distributed algorithms. System models include synchronous versus asynchronous systems, communication models, and failure models. Several fundamental problems are covered, including consensus, atomic broadcast, atomic multicast, atomic commit, and data consistency. Applications of distributed algorithms target various forms of replication techniques.

 
Area
Theory and Algorithms

Find out what can and cannot be computed, and how to compute it. More...

 
Gold sponsors:
Silver sponsor:
Con la collaborazione di: