Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

NI-PDP Parallel and Distributed Programming Extent of teaching: 2P+2C
Instructor: Tvrdík P. Completion: Z,ZK
Department: 18104 Credits: 6 Semester: L

Annotation:
21st century in computer architectures is primarily influenced by the shift of the Moore's law into parallelization of CPUs at the level of computing cores. Parallel computing systems are becoming a ubiquitous commodity and parallel programming becomes the basic paradigm of development of efficient applications for these platforms. Students get acquainted with architectures of parallel and distributed computing systems, their models, theory of interconnection networks and collective communication operations, and languages and environments for parallel programming of shared and distributed memory computers. They get acquianted with fundamental parallel algorithms and on selected problems, they will learn the techniques of design of efficient and scalable parallel algorithms and methods of performance evaluation of their implementations. The course includes a semester project of practical programming in OpenMP and MPI for solving a particular nontrivial problem.

Lecture syllabus:
1. Introduction into parallel and distributed programming.
2. Introduction into OpenMP.
3. Parallel algorithms for the state space search.
4. Prpgramming and performance tuning in OpenMP.
5. Parallel sorting in OpenMP.
6. Introduction into MPI.
7. Interconnection networks of parallel computers I.
8. Interconnection networks of parallel computers II.
9. Collective communication operations.
10. Parallel reduction and parallel scan. Parallel I/O.
11. Parallel algorithms in OpenMP/MPI I.
12. Parallel algorithms in OpenMP/MPI II.

Seminar syllabus:
1. Design and implementation of a sequential algorithm in C/C++.
2. Design and implementation of a parallel algorithm using OpenMP task parallel constructs.
3. Design and implementation of a parallel algorithm using OpenMP data parallel constructs.
4. Design and implementation of a parallel algorithm using MPI on a cluster.
5. Analysis of parallel performance and scalability of the resulting program and writing a technical report.

Literature:
[1] Mattson, T.G. - Sanders, B.A. - Massingill, B.L.: Patterns for Parallel Programming. Addison-Wesley Professional. 2004. 978-0321940780.
[2] Kumar, V. - Grama, A. - Gupta, A. - Karpis, G.: Introduction to Parallel Computing: Design and Analysis of Parallel Algorithms. Benjamin-Cummings. 1994. 0805331700.
[3] Miller, R. - Boxer, L.: Algorithms Sequential and Parallel: A Unified Approach. Pearson Education. 1999. 0130863734.
[4] Wilkinson, B. - Allen, M.: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall. 1998. 0136717101.
[5] Jaja, J.: An Introduction to Parallel Algorithms. Addison-Wesley. 1992. 0201548569.

Requirements:
Basic sequential algorithmics, programming, the C/C++programming language, complexity theory, computer architecture, graph theory.

https://courses.fit.cvut.cz/MI-PDP/

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
NI-PB.2020 Computer Security PP 2
NI-ZI.2020 Knowledge Engineering PP 2
NI-SPOL.2020 Unspecified Branch/Specialisation of Study PP 2
NI-TI.2020 Computer Science PP 2
NI-TI.2023 Computer Science PP 2
NI-SP.2023 System Programming PP 2
NI-WI.2020 Web Engineering PP 2
NI-SP.2020 System Programming PP 2
NI-SI.2020 Software Engineering (in Czech) PP 2
NI-MI.2020 Managerial Informatics PP 2
NI-PSS.2020 Computer Systems and Networks PP 2
NI-NPVS.2020 Design and Programming of Embedded Systems PP 2


Page updated 29. 3. 2024, semester: L/2021-2, Z,L/2023-4, Z/2021-2, Z/2020-1, Z/2019-20, L/2020-1, Z,L/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška