Moses - Distributed Algorithms

Display language

To modulepage Generate PDF

Diese Modulbeschreibung gilt nicht im aktuellen Semester.

Die Modulbeschreibung gilt nur für den Zeitraum WS 2019/20 - WiSe 2022/23.

Module / Version:
#40415 / #7

Validity:
WS 2019/20 - WiSe 2022/23

Default display language:
English

Module title:
Distributed Algorithms

Credits:
6

Responsible person:
Hauswirth, Manfred

Grading:
benotet

Type of exam:
Portfolioprüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Telekommunikationssysteme

Area of expertise:
34332300 FG Open Distributed Systems

Prüfungsausschuss:
No information

Kontakt

Office:
HFT 3

Contact person:
Le Phuoc, Danh

E-mail address:
lehre@ods.tu-berlin.de

Website:

http://www.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

* Models for distributed systems * Flooding, echo, broadcast * Election * Distributed termination detection * Mutual exclusion * Logical clocks, vector clocks, clock synchronization * Distributed snapshots * Fault tolerance basics * Consensus * Replication * Distributed memory * Distributed transactions

Module Components

Pflichtteil:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Distributed Algorithms	VL	0432 L 524	WiSe	No information	2
Distributed Algorithms	UE	0432 L 524	WiSe	No information	2

Workload and Credit Points

Distributed Algorithms (VL):

Workload description	Multiplier	Hours	Total
Preparation and follow-up	15.0	2.0h	30.0h
Presence	15.0	2.0h	30.0h
			60.0h(~2 LP)

Distributed Algorithms (UE):

Workload description	Multiplier	Hours	Total
Homework	15.0	4.0h	60.0h
Presence	15.0	2.0h	30.0h
			90.0h(~3 LP)

Course-independent workload:

Workload description	Multiplier	Hours	Total
Exam preparation	1.0	30.0h	30.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

Portfolio examination

Type of portfolio examination

100 Punkte insgesamt

Language

English

Test elements

Name	Points	Categorie	Duration/Extent
Ergebnisprüfung (Deliverable assessment) UE: 3x laboratory work with oral presentation	50	practical	depends on the chosen topic
Punktuelle Leistungsabfrage (Examination) VL: written test (Multiple-Choice-Test)	50	written	60 mins

Grading scale

Notenschlüssel »Notenschlüssel 2: Fak IV (2)«

Gesamtpunktzahl	1.0	1.3	1.7	2.0	2.3	2.7	3.0	3.3	3.7	4.0
100.0pt	95.0pt	90.0pt	85.0pt	80.0pt	75.0pt	70.0pt	65.0pt	60.0pt	55.0pt	50.0pt

Test description (Module completion)

Successful completion of 50% assignments (25 out of 50 portfolio points from 3x laboratory work with oral presentation) is a prerequisite.

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

The maximum capacity of students is 40.

Registration Procedures

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

Recommended literature
G. Coulouris, J. Dollimore, and T. Kindberg. Distributed Systems: Concepts and Design. Addison-Wesley, 5th edition, 2011. [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

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

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

	Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
This module is not used in any degree program.

Miscellaneous

No information

Distributed Algorithms