Parallel (and Distributed) Algorithms (WS 2023/2024)

Lectures

Prof. Dr. Ulrich Meyer

Tue, 12:00 - 14:00, in SR11
Wed, 12:00 - 14:00, in SR11

Tutorials

Manuel Penschuck
Alexander Leonhardt
Wed, 14:30 - 16:00, in H3 (Hörsaaltrakt Bockenheim, Gräfstraße 50-54)

Language

The lecture is held in English. By mutual agreement, the language of instruction can be changed to German, too.

You can solve the assignments in German or in English.

Content

We shortly survey existing concepts of parallel computers (e.g., multicomputer clusters, shared-memory CPUs, and GPUs), and introduce theoretical abstractions of these machines. We start by analysing algorithms for multicomputers consisting of several independent compute nodes interconnected by a network. Based on the observation that practical algorithms for these machines typically seek to minimize communication costs, we discuss and quantify the impact of various network topologies. Subsequently, we develop and analyse distributed communication primitives and algorithms for classical problems, such as sorting.

We then switch to algorithms for multiprocessor architectures which are formally expressed by the PRAM model. This part emphasizes algorithms for linked lists and trees, search-, distribution-, and sorting problems and topics of graph theory. Throughout the lecture, we will analyze not only upper-bounds (leading to efficiency guarantees), but also consider lower-bounds: These include minimal costs for communication in certain topologies, the comparison of various PRAM variants, and the introduction of P-completeness to gain insight into the parallelizability of problems. Literature

• A. Grama, A. Gupta, G. Karypis und V. Kumar: Introduction to Parallel Computing, second edition, Addison-Wesley 2003.
• M. J. Quinn: Parallel Computing in C with MPI and OpenMP, McGraw-Hill, 2004.
• J. JáJá: An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
• R.M. Karp und V. Ramachandran, Parallel algorithms for shared memory machines, in J van Leeuven (Ed.): Handbook of Theoretical Computer Science A, Kapitel 17, pp. 869-941, ElsevierScience Publishers, 1990.
• P-completeness: R. Greenlaw, H.J. Hoover und W.L. Ruzzo: Limits to Parallel Computation, Oxford University Press, 1995.

Materials

Lecture notes

• First part of a Script for a previous lecture PDA
• Hand-written original version

Some resources which might be useful

• Slides on parallel linear algebra by Georg Schnitger
• Diploma thesis of Ulrich Meyer
• Routing on Meshes, PhD. Thesis of Jop F. Sibeyn

Lectures

Assignments