FI:IV100 Distributed computations - Course Information

IV100 Parallel and distributed computations

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

doc. RNDr. Dana Pardubská, Ph.D. (lecturer), prof. RNDr. Antonín Kučera, Ph.D. (deputy)
prof. RNDr. Ivana Černá, CSc. (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Antonín Kučera, Ph.D.

Timetable

each odd Tuesday 15:00–18:50 A107

Prerequisites

IB002 Algorithms I || I002 Algorithms I || I502 Algorithms I
IB002 (Design of algorithms), required. PB152 (Operating systems) recommended.

Course Enrolment Limitations

The course is only offered to the students of the study fields the course is directly associated with.

The capacity limit for the course is 70 student(s).
Current registration and enrolment status: enrolled: 0/70, only registered: 0/70

fields of study / plans the course is directly associated with

• Applied Informatics (programme FI, B-AP)
• Applied Informatics (programme FI, N-AP)
• Informatics with another discipline (programme FI, B-BI)
• Informatics with another discipline (programme FI, B-FY)
• Informatics with another discipline (programme FI, B-GE)
• Informatics with another discipline (programme FI, B-GK)
• Informatics with another discipline (programme FI, B-CH)
• Informatics with another discipline (programme FI, B-IO)
• Informatics with another discipline (programme FI, B-MA)
• Informatics with another discipline (programme FI, B-SO)
• Informatics with another discipline (programme FI, B-TV)
• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)

Course objectives

Introduction to distributed algorithms. Basic notions, problems and solutions.

Syllabus

• Distributed systems and distributed algorithms.
• Communication protocols. Alternating-bit protocol, sliding-window protocol.
• Routing algorithms. Routing tables and algorithms for their constructions. Floyd-Warshallův algorithm, shortest-path algorithm.
• Distributed mutual exclusion.
• Distributed election algorithms. Ring networks and a general topology.
• Termination detection. Dijkstra-Scholten algorithm.
• The problem of Byzantine generals and its (un)solvability in various environments.

Literature

• BARBOSA, Valmir C. An introduction to distributed algorithms. Cambridge: MIT Press, 1996, xiii, 365. ISBN 0262024128. info
• TEL, Gerard. Introduction to distributed algorithms. Cambridge: Cambridge University Press, 1994, xii, 534. ISBN 0521470692. info

Assessment methods (in Czech)

písemná zkouška případně doplněna zkouškou ústni

Language of instruction

Slovak

Further Comments

The course is taught annually.

• Enrolment Statistics (Autumn 2005, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2005/IV100