Code: BE4M35PAG Parallel algorithms
Lecturer: doc. Ing. Přemysl ©ůcha Ph.D. Weekly load: 2P+2S Completion: A, EX
Department: 13135 Credits: 6 Semester: W
Description:
In the introductory lectures, we will focus on general approaches to design of parallel algorithms and their properties important for understanding the fundamental principles of parallel and distributed algorithms. Subsequently we will talk about fundamental parallel algorithms; typically, constituting cornerstones of algorithms for real-world problems. The laboratory exercise will be aimed at hardware platform commonly used in practice.
Contents:
1. Introduction to Parallel Computing
2. Principles of Parallel Algorithms Design
3. Basic Communication Operations
4. Analytical Modeling of Parallel Algorithms
5. Matrix Algorithms
6. Algorithms for Linear Algebra
7. Sorting, TEST
8. Parallel Accelerators
9. Graph Algorithms I.
10. Graph Algorithms II.
11. Combinatorial Algorithms
12. Dynamic Programming
13. Fast Fourier Transform
Seminar contents:
1. Introduction to parallel programming, environment setting
2. Introduction to Cpp11 threads
3. Advanced constructs in Cpp11
4. Assignment of the semestral work + homework 1
5. OpenMP - basic constructs
6. OpenMP - vectorization, parallel sort
7. Homework 2, deadline for homework 1
8. Semestral work - consultation
9. OpenMPI - distributed algorithms
10. Homework 3, deadline for homework 2
11. Semestral work - consultation
12. Presentations of semestral works
13. deadline for homework 3, student assessment
Recommended literature:
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to Parallel Computing, Second Edition, Addison Wesley, 2003.
2. Kayhan Erciyes: Distributed Graph Algorithms for Computer Networks, Springer, 2013.
3. Georg Hager, Gerhard Wellein: Introduction to High Performance Computing for Scientists and Engineers, CRC Press, 2011.

Abbreviations used:

Semester:

Mode of completion of the course:

Weekly load (hours per week):