|
|
Root number
|
454448 |
|
Semester
|
HS2024 |
|
Type of course
|
Lecture |
|
Allocation to subject
|
Computer Science |
|
Type of exam
|
not defined |
| Title |
Distributed Algorithms |
| Description |
This course provides an introduction to computing by concurrent processes in a distributed environment without a central coordinator. It presents fundamental programming abstractions for distributed systems and fault-tolerant, highly available, and secure protocols that implement them. Important problems of distributed computing are discussed and influential impossibility results are shown. The central question of the course is how to tolerate uncertainty and adversarial influence, which may arise from network delays, faults, or malicious attacks in a distributed system. Topics include replication, quorums, reliable broadcast, distributed storage, consensus, Byzantine agreement, atomic broadcast, and notions of consistency arising in this setting. Applications to real-world systems will be presented, in the domain of cloud computing, cryptocurrencies, and blockchain systems. |
|
ILIAS-Link (Learning resource for course)
|
No registration/deregistration in CTS (Admission in ILIAS possible).
ILIAS
|
|
Link to another web site
|
|
| Lecturers |
Prof. Dr.
Christian Cachin, Institute of Computer Science ✉
|
|
ECTS
|
5 |
|
Recognition as optional course possible
|
Yes |
|
Grading
|
1 to 6 |
| |
| Dates |
Wednesday 14:15-17:00 Weekly
|
| |
| Rooms |
Hörsaal 2 002, Engehalde, E8
|
|
Seminarraum 109, Engehalde, E8
|
| |
| Students please consult the detailed view for complete information on dates, rooms and planned podcasts. |
User:
Öffentlicher Bereich
Support