4 SWS, Mo 16-18 c.t., Wed 12-14 c.t., SR 11
2 SWS, Wed, 8-10 c.t., SR11, starting 24.10.
Announcement: The part of the
lectures that belongs the computational science masters program ends on Dec.12.
Examination dates can be arranges via email.
††† Distributed and
shared memory: shared memory models, MPI and its communication functions,
††† communication patterns such as trees,
meshes and hypercube architectures.
††† Parallel linear algebra: solving
linear systems, finite difference methods, the fast Fourier transform.
††† Search and optimization: Monte Carlo methods, backtracking, branch & bound,
††† Load balancing and termination
††† Parallel random access machines:
algorithms for lists and graphs.
participation in the tutorials (regular and active attendance, 60% of the
maximal score has to be obtained in the exercises) is required to obtain a
certificate for the course in the computer science curriculum. The
master’s degree students can obtain 3 credit points by doing an oral exam
about the first half of the course. For them the tutorial is optional
Lectures 8-11 and Gaussian Elimination
Grama, A. Gupta, G. Karypis und V. Kumar, Introduction to Parallel Computing,
second edition, Addison-Wesley 2003
J. Quinn, Parallel Computing in C with MPI and OpenMP, McGraw-Hill, 2004
1.3.2008, Hartmut Klauck