Lecture "Efficient parallel algorithms"
(This course will be held in German)
Responsible Lecturer:
Prof. Dr. Wolfgang E. Nagel
Contact person:
Course description:
The course "Efficient Parallel Algorithms" provides in-depth knowledge of parallel programming. It introduces parallel algorithms and parallel data structures. In particular, search algorithms, sorting algorithms, graph algorithms and algorithms from linear algebra are considered and their efficient parallelization is discussed. Furthermore, design principles and evaluation criteria for parallel algorithms are presented.
Scope:
4 SWS (2 SWS lecture, 2 SWS exercise)
Degree programs:
- Degree programs Computer Science, Information Systems Engineering
- Master's degree program Computer Science
- Bachelor's degree programs Computer Science, Media Computer Science
- Master's degree programs Mathematics, Technomathematics, Mathematics in Business and Economics
- Master's degree program Computational Science and Engineering
- Other interested parties on degree programs in natural sciences and engineering
Course offered in:
Winter semester
Recommended semester(s):
- Diploma degree programs - main studies
- Bachelor's degree programs - 5th semester
- Master's degree programs - 3rd semester
Module assignment:
INF-B-510, INF-B-520, INF-B-530, INF-B-540, INF-E-3, INF-PM-FOR, INF-VERT5, MA-CSE-35, MATH-MA-INFHR
Notes on study material:
Lecture and exercise material as well as details of the dates will be made available in OPAL.
IF YOU HAVE ANY FURTHER QUESTIONS, PLEASE CONTACT:
© Michael Kretzschmar
Mitarbeiter
NameMr Markus Velten M.Sc.
Send encrypted email via the SecureMail portal (for TUD external users only).
Visiting address:
Willers-Bau, Room A 103 Zellescher Weg 12
01069 Dresden