FI:I016 Distributed Algorithms - Course Information

I016 Distributed Algorithms

Faculty of Informatics
Autumn 1997

Extent and Intensity

3/0. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

doc. Ing. Lenka Carr Motyčková, CSc. (lecturer)

Guaranteed by

Contact Person: doc. Ing. Lenka Carr Motyčková, CSc.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Syllabus

Distributed programming paradigms appear nowadays in many areas as computer networks, distributed databases or distributed operating sysytems. Distributed algorithms solve well known parallel computing problems (mutual exclusion) as well as problems typical for a distributed environment (routing).
Models of distributed algorithms.
Graph traversal distributed algorithms.
A minimal spanning tree construction. Routing.
Synchronization algorithms.
A logical clock, a mutual exclusion in a distributed model.
Leader election.
A Byzantine agreement.
Anonymous networks.
Global snapshot.
Detection of communication deadlock.
Centralized, hierarchical and distributed deadlock detection algorithms.
Termination detection.

Language of instruction

Czech

The course is also listed under the following terms Autumn 1995, Autumn 1996.