Start

Einleitung

Dominik Schreiber SAT Solving and Automated Planning

Overview

The SAT Problem

SAT Solving

Parallel SAT Solving

Automated Planning

SAT-based Planning

Outlook: Future Research and Teaching

Sebastian Lamm Distributed Connected Components

Connected Components and Applications

Sequential Algorithms

General Framework

All-Reduce (AR) Algorithm

Union-find merging (UFM)

Graph Contraction (GC) Algorithm

Label Propagation (LP)

Comparison

Conclusion

Sebastion Schlag High Quality Hypergraph Partitioning

Applications

Parallel Sparse-Matrix Vector Product (SpM x V)

From SpM x V to Hypergraph Partitioning

How does Hypergraph Partitioning work?

Taxonomy of Hypergraph Partitioning Tools

Why Yet Another Multilevel Algorithm?

Latest Experimental Results

KaHyPar Karlsruhe Hypergraph Partitioning

Tobias Maier Parallele Algorithmen - Einschub Shared Memory Datenstrukturen

Concurrent Hash Table

Migration als Lösung

Vergrößern der Hash Tabelle

Deallocation Problem