Course: Distributed and Parallel Algorithms

» List of faculties » FBI » UAI
Course title Distributed and Parallel Algorithms
Course code UAI/630
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Frequency of the course In each academic year, in the winter semester.
Semester Winter
Number of ECTS credits 4
Language of instruction Czech
Status of course Compulsory-optional, Optional
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Fesl Jan, Ing. Ph.D.
Course content
1) Distributed systems, enumerations, basic terms, introduction 2) Communication between processors - synchronous and asynchronous communication model 3) Communication in groups, atomicity, message passing, causality, the vector clock 4) Synchronization - physical and logical time, process synchronisation, the global system state detection 5) Topological problems - parallel topologies, distributed environment, backbone construction 6) Routing algorithms - flow control, algorithms for shortest paths detection 7) Routing algorithms for mobile and ad-hoc networks 8) Distributed shared memory 9) Distributed hash tables and peer to peer mechanisms 10) Basics of distributed databases - transactions, implementation of transactions, concurrency check 11) Algorithms of distributed databases - confirmation, locking, mutual exclusion 12) Introduction into parallel architectures - theory of parallel complexity, types of architectures, benchmarking 13) Models of parallel architectures - PRAM, APRAM, implementation of efficient algorithms 14) Searching of parallel state-space

Learning activities and teaching methods
Monologic (reading, lecture, briefing)
  • Class attendance - 40 hours per semester
  • Preparation for exam - 30 hours per semester
  • Preparation for credit - 40 hours per semester
Learning outcomes
The course contains a basic overview of the distributed and parallel systems for the possibility of their creation. The students get acquainted with the algorithm principles and get the basic knowledge from middleware technologies as well.
The student will gain a basic overview of existing types of distributed algorithms for solving specific problems.
Prerequisites
Just only the basic knowledge of the computer networks area and elementar algorithms is required.

Assessment methods and criteria
Oral examination, Test

Writing a semester test with a success rate of more than 50%.
Recommended literature
  • George Colouris. Distributed Systems: Concepts and Design. 2011. ISBN 0132143011.
  • Pavel Tvrdík. Paralelní systémy a algoritmy. Praha, 2006.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Science Study plan (Version): Applied Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Winter