Parallele Algorithmen: Materialien zur Vorlesung

1. Vorlesungsfolien
2. Vorlesung zu shared memory Datenstrukturen
3. Gastvortrag Robust Hypercube Quicksort
4. Gastvortrag Multilevel Samplesort
5. Skript
6. Themenliste Miniseminar
7. Programmieraufgaben

Miniseminar: 14.2.2017 im SR 301 ab 13:00

1. Helge Ebhard: A simple and practical linear-work parallel algorithm for connectivity
2. Jerome Urhausen: Parallel shortest-paths using radius stepping
3. Roland Osterrieter: Randomized routing and sorting on fixed-connection networks
4. Oliver Plate: Ordering heuristics for parallel graph coloring
5. Daniel Ferizovic: Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
6. Lasse Wulf: Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
7. Benedict Toussaint: Parallel Heap: An Optimal Parallel Priority Queue
8. Artem Titarenko: An Optimal Parallel Algorithm for Integer Sorting
9. Sebastian Bayer: Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures