Search
Lecturer: Přemysl Šůcha
Lab teachers: Nikolai Antonov Martin Henych Petr Stejskal
Quick links: UploadSystem
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 exercises will be aimed at hardware platform commonly used in practice (multi-core CPUs).
C/C++, basic Linux skills, algorithms
To get an ungraded assessment the following requirements have to be met:
To pass the exam it is necessary to get at least 20 points (maximum 45 points) from the written exam. The oral exam is mandatory and gives 10 points at maximum.
Extension of the homework deadlines is not possible! The only exception is a serious health or family issue proven, for example, by a medical certificate. We also do not award assessments (zápočety) after the examination period starts.
Final grading scale:
For the written and oral exams, you will need a pen and pencil. The exam tests both the knowledge from lectures and seminars.
[1] Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar: Introduction to Parallel Computing, Second Edition, Addison Wesley, 2003.
[2] Georg Hager, Gerhard Wellein: Introduction to High Performance Computing for Scientists and Engineers, CRC Press, 2011.
[3] James Reinders, Jim Jeffers: Intel Xeon Phi Coprocessor High-Performance Programming, Newnes, 2013.