Skip to main content
Skip header

Parallel Algorithms

Summary

The course covers both theoretical and practical elements of parallel programming and algorithms, to help the students make efficient use of modern multiprocessor and multicomputer hardware (including supercomputers) for solution of computationally demanding task from various application fields. A variety of algorithms and hardware and software tools for parallel and High Performance Computing are introduced, but the focus lies on the so-called loosely coupled systems (without shared memory), where the interaction of parallel activities is based on message passing. Individual approach, allowing application and intensification of the gained knowledge in the student's specific field of Ph.D. study, is supposed.

Literature

• I. Foster: Designing and Building Parallel Programs. Addisson-Wesley, 1995.
Standardizační dokumentace k MPI, OpenMP

Advised literature

• A. Grama et al.: Introduction to Parallel Computing, Second Edition. Pearson, 2003.
• C. Lyn, L. Snyder: Principles of Parallel Programming. Pearson, 2009.
• J. JáJá: An Introduction to Parallel Algorithms. Addison-Wesley, 1992.


Language of instruction čeština, angličtina
Code 460-6008
Abbreviation PA
Course title Parallel Algorithms
Coordinating department Department of Computer Science
Course coordinator prof. Ing. Pavel Krömer, Ph.D.