The lecture evaluation will take place on 01.12. from 10 to 12.
Lectures and tutorials will take place electronically.
Tue, 10:00 - 12:00
Thu, 10:00 - 12:00
Please contact us via firstname.lastname@example.org
Thu, 12.15 - 13.45
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.
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
|Assignment 1||10.11.||17.11 at 10 AM||update 1 pm 10.11, removed exercise 1.3|
|Assignment 2||17.11.||24.11 at 10 AM||-|
|Assignment 3||24.11.||01.12 at 10 AM||-|