Course details
Parallel and Distributed Algorithms
Guarantor
Hanáček Petr, doc. Dr. Ing. (DITS)
Language of instruction
Czech
Completion
Credit+Examination
Time span
- 39 hrs lectures
- 13 hrs projects
Department
Study literature
- Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
- Reif, J: Synthesis of Parallel Algorithms, Morgan Kaufmann, 1993, ISBN:155860135X
Fundamental literature
- Akl, S.: The Design and Analysis of Parallel Algorithms, Prentice-Hall International, ISBN 0-13-200073-3
- Jaja, J.: An Introduction to Parallel Algorithms, Addison-Wesley, 1992, ISBN 0-201-54856-9
- Tvrdík, P.: Parallel Systems and Algorithms, skripta, Praha, Vydavatelství ČVUT 1997.
Syllabus of lectures
- Introduction, architectures and languages for parallel and distributed processing.
- Abstract models of parallel computing, PRAM (Parallel Random Access Machine).
- Distributed and parallel algorithms and their complexity.
- Interaction between processes, communication, synchronization.
- Topologie, synchrinous and asynchronous algorithms.
- Algorithms for parallel sorting.
- Algorithms for parallel searching.
- Parallel matrix operations.
- All prefix sums and their applications.
- Graph and list algorithms.
- Synchronization algorithms and tasks.
- Mechanisms and language constructs for synchronization.
- Languages for parallel and distributed computing.
Course inclusion in study plans