Display language
To modulepage Generate PDF

#40415 / #4

SS 2017 - SS 2017

English

Distributed Algorithms

6

Kao, Odej

benotet

Mündliche Prüfung

Zugehörigkeit


Fakultät IV

Institut für Telekommunikationssysteme

34332300 FG Open Distributed Systems

No information

Kontakt


HFT 3

Le Phuoc, Danh

lehre@ods.tu-berlin.de

Learning Outcomes

Students who have successfully finished this module know the most important basic algorithms for distributed systems and their respective properties. They know typical structures of distributed algorithms and can evaluate the complexity, scalability and fault tolerance properties. The students can apply their knowledge for selecting appropriate algorithms while designing distributed systems.

Content

No information

Module Components

Pflichtteil:

All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Distributed AlgorithmsVL0432 L 524WiSeNo information2
Distributed AlgorithmsUE0432 L 524WiSeNo information2

Workload and Credit Points

Distributed Algorithms (VL):

Workload descriptionMultiplierHoursTotal
Preparation and follow-up 15.02.0h30.0h
Presence15.02.0h30.0h
60.0h(~2 LP)

Distributed Algorithms (UE):

Workload descriptionMultiplierHoursTotal
Assignments1.060.0h60.0h
Presence15.02.0h30.0h
90.0h(~3 LP)

Course-independent workload:

Workload descriptionMultiplierHoursTotal
Exam preparation1.030.0h30.0h
30.0h(~1 LP)
The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

Description of Teaching and Learning Methods

The lecture conveys the material in traditional form. The tutorial encompasses interactive discussion of issues related to the lecture material. Students may present results of their assignments (homework).

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic skills in distributed systems. Sufficient knowledge about the contents of both courses "Systemprogrammierung" and "Rechnernetze und verteilte Systeme" or both courses "Technische Grundlagen der Informatik für Wirtschaftsinformatiker" and "Programmierpraktikum".

Mandatory requirements for the module test application:

1. Requirement
[KBS] Distributed Algorithms Assignments

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

20 Minuten

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Wintersemester.

Maximum Number of Participants

This module is not limited to a number of students.

Registration Procedures

See http://www.cit.tu-berlin.de

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable

 

Electronical lecture notes

Availability:  available
Additional information:
http://www.cit.tu-berlin.de/

 

Literature

Recommended literature
F. Mattern. Verteilte Basisalgorithmen. Springer-Verlag, 1989
G. Coulouris, J. Dollimore, and T. Kindberg. Distributed Systems: Concepts and Design. Addison-Wesley, 4th edition, 2005. [auch in Deutsch erhältlich].
G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, 2000.
H. Attya, J. Welch: Distributed Computing. John Wiley, 2004
N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
S. Mullender, editor. Distributed Systems. Addison-Wesley, 2nd edition, 1993
S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. 2nd ed., Pearson, 2007. [auch in Deutsch erhältlich].

Assigned Degree Programs


This module is used in the following Degree Programs (new System):

Studiengang / StuPOStuPOsVerwendungenErste VerwendungLetzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Miscellaneous

This module is offered every year.