28 |

0:00:00 Start

0:00:05 Einleitung

0:00:28 Dominik Schreiber - SAT Solving and Automated Planning

0:00:41 Overview

0:01:51 The SAT Problem

0:03:39 SAT Solving

0:05:06 Parallel SAT Solving

0:09:30 Automated Planning

0:13:20 SAT-based Planning

0:17:44 Outlook: Future Research and Teaching

0:23:16 Sebastian Lamm - Distributed Connected Components

0:23:45 Connected Components and Applications

0:25:23 Sequential Algorithms

0:26:16 General Framework

0:29:04 All-Reduce (AR) - Algorithm

0:31:14 Union-find merging (UFM)

0:35:26 Graph Contraction (GC) - Algorithm

0:38:21 Label Propagation (LP)

0:40:44 Comparison

0:43:14 Conclusion

0:44:40 Sebastion Schlag - High Quality Hypergraph Partitioning

0:47:24 Applications

0:48:57 Parallel Sparse-Matrix Vector Product (SpM x V)

0:52:09 From SpM x V to Hypergraph Partitioning

0:56:33 How does Hypergraph Partitioning work?

0:59:27 Taxonomy of Hypergraph Partitioning Tools

1:01:07 Why Yet Another Multilevel Algorithm?

1:05:30 Latest Experimental Results

1:08:45 KaHyPar - Karlsruhe Hypergraph Partitioning

1:10:20 Tobias Maier - Parallele Algorithmen - Einschub Shared Memory Datenstrukturen

1:12:12 Concurrent Hash Table

1:17:19 Migration als Lösung

1:20:33 Vergrößern der Hash Tabelle

1:24:09 Deallocation Problem