direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Foundations of Distributed Systems (Integrated course, SoSe 2012)

All computing systems nowadays are distributed, ranging from Internet-scale services to multiprocessors. Therefore, understanding the principles of distributed computing is increasingly important in all aspects of designing and engineering modern computing systems.

Students that complete this module will get a basic understanding of how to design distributed algorithms, reason about their correctness, and derive complexity bounds for distributed computing problems. The notion of a system implementation is treated here in the algorithmic sense (there will be no Java or C code).

News

  • This course will be held in Engilish.

Overview

Information
Lecturers:
Petr Kuznetsov, Stefan Schmid,
Uwe Nestmann (FG MTV)
Additional contact person:
Srivatsan Ravi
Event type:
Integrated course (Integrierte Veranstaltung)
Area:
Master of Computer Science: Dependabale Systems, Communication-based Systems (Master Informatik: Verlässliche Systeme, Kommunikationsbasierte Systeme)
Master of Computer Engineering: Software Engineering (Master Technische Informatik: Software Engineering)
Module:
MINF-VS-FDS.S12
exam&module registration:
tba
SWS:
4
ECTS/LP:
6
Time:
tuesdays, 12–2 p.m., weekly
First meeting:
10 April 2012
Room:
Auditorium 2 (TEL 20)
Tutorial:
mondays, 4–6 p.m., weekly
TEL 1118/19
Course ID:
0432 L 819 / 0434 L 350
Audience:
bachelor students after their basic studies (from the fifth semester on), master students, and Diplom students
Prerequisites:
No particular module, but maturity in mathematics, algorithms, and programming is expected.
Exam:
oral, further details will be announced later
Further information:
see corresponding ISIS page

Content

Shared-memory and message-passing algorithms; fault-tolerance; shared-memory transformations; consensus and state-machine replication; message passing; network topologies and architectures; local algorithms and scalability; time and message complexity; leader election, medium access, graph coloring; robust algorithms for dynamic networks; peer-to-peer networks; social networks: game theory and incentive-compatible algorithms

Organization

Registration

If you are interested in attending, please make sure you are subscribed to this course in ISIS to receive information and announcements.

A module registration is also obligatory for Master studetns. Further information will be given in the lecture or via ISIS.

Homework

There will be exercises (exercise sheets). You need 50% of the possible points to pass.

Exam

Oral exam. Further information will be announced in the lecture or via ISIS.

More slides and further information (research papers, exercises) are available on the ISIS page.

Literature

General Literature

  • Lynch, N: Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
  • H. Attiya, J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). Wiley. 2004
  • M. Herlihy and N. Shavit. The art of multiprocessor programming. Morgan Kaufman, 2008
  • David Peleg, Distributed Computing: A Locality Sensitive Approach, SIM, 1987.

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Foundations of Distributed Systems – Complexity and Computability
0432 L 819 / 0434 L350
Integrierte LV (VL mit UE)

Lecturer: Petr Kuznetzsov, Stefan Schmid, Uwe Nestmann

Period:
10.04.2012 to 31.08.2012

Mo 16:00 - 18:00 o'clock
Tu 12:00 - 14:00 o'clock

Location: Auditorium 2 (tue/Di), TEL 1118/19 (mon/Mo)

Website
ISIS

Hint:
Tue: Lecture; Mon: Tutorial

Complete domains

...of e-mail addresses
@inet =
@inet.tu-berlin.de
@tub = @tu-berlin.de