FI:IB109 Design of Parallel Systems - Course Information
IB109 Design and Implementation of Parallel Systems
Faculty of InformaticsSpring 2026
- Extent and Intensity
- 2/0/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
In-person direct teaching - Teacher(s)
- prof. RNDr. Jiří Barnat, Ph.D. (lecturer)
- Guaranteed by
- prof. RNDr. Jiří Barnat, Ph.D.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable
- Wed 18. 2. to Wed 13. 5. Wed 16:00–17:50 FAST/D182
- Prerequisites
- The knowledge of low-level programming in C is expected at the level PB111.
- 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
- there are 37 fields of study the course is directly associated with, display
- Abstract
- The goal of this course is to introduce to students the principles of design and implementation of parallel systems and get them acquainted with the programmer's means for their development.
- Learning outcomes
- On successful completion, students should understand the principles of design and implementation of parallel algorithms and should have limited experience with programmer's means for their development. In particular, students should be able to design and implement their own parallel applications, they should know how to use selected libraries supporting the development of parallel applications, and should be able to explain what is behind the API calls to such libraries.
- Key topics
- Motivation for parallel computing. Parallel algorithm design -- decomposition and communication. Analyzes of parallel algorithms. Parallel algorithms in shared-memory.OpenMP, Intel TBB. POSIX Threads. Lock-free algorithmics. Parallel algorithms in distributed-memory. Message Passing Interface (MPI). Examples of parallel graph algorithms. Parallel algorithms for many-core platforms.
- Study resources and literature
- HERLIHY, Maurice and Nir SHAVIT. The art of multiprocessor programming. Amsterdam: Elsevier, 2008, xx, 508. ISBN 9780123705914. info
- Approaches, practices, and methods used in teaching
- lectures, tutorial demonstrations
- Method of verifying learning outcomes and course completion requirements
- The course is completed with a written exam.
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Teacher's information
- http://www.fi.muni.cz/~xbarnat/IB109/index.html
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/spring2026/IB109