#
FI:IV100 Distributed computations - Course Information

## IV100 Parallel and distributed computations

**Faculty of Informatics**

Autumn 2008

**Extent and Intensity**- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
**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 even Tuesday 12:00–15:50 A107
**Prerequisites**-
**IB002**Algorithms I

IB002 (Design of algorithms), required. PB152 (Operating systems) recommended. **Course Enrolment Limitations**- The course is also offered to the students of the fields other than those 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, only registered with preference (fields directly associated with the programme):**0**/70 **fields of study / plans the course is directly associated with**- there are 39 fields of study the course is directly associated with, display
**Course objectives**- The aim of the course is to introduce students into the field of distributed computation. It presents the basic concepts, problems and solutions. Algorithms for selected group of problems give the insight into the techniques used in the field and show how the various environments influence the quality and (un)solvability of the problem.
**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. Netchange(self-stabilization); compact routing(interval schemes, lower bounds)
- Distributed mutual exclusion.
- Distributed election algorithms. Ring networks and a general topology. Impact of synchrony. Impact of sense of direction.
- 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 - LYNCH, Nancy A.
*Distributed algorithms*. San Francisco: Morgan Kaufmann Publishers, 1996. xxiii, 872. ISBN 1-55860-348-4. info - TEL, Gerard.
*Introduction to distributed algorithms*. Cambridge: Cambridge University Press, 1994. xii, 534. ISBN 0521470692. info - LEIGHTON, Frank Thomson.
*Introduction to parallel algorithms and architectures :arrays, trees, hypercubes*. San Mateo: Morgan Kaufmann Publishers, 1992. xviii, 831. ISBN 1-55860-117-1. info

- BARBOSA, Valmir C.
**Assessment methods**- The course has a form of the lecture. It is concluded by the written exam possibly combined with the oral exam.
**Language of instruction**- Slovak
**Further Comments**- The course is taught annually.

- Enrolment Statistics (Autumn 2008, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2008/IV100