Parallele Algorithmen: Materialien zur Vorlesung
- Vorlesungsfolien
- Vorlesung zu shared memory Datenstrukturen
- Gastvortrag Robust Hypercube Quicksort
- Gastvortrag Multilevel Samplesort
- Skript
- Themenliste Miniseminar
- Programmieraufgaben
Miniseminar: 14.2.2017 im SR 301 ab 13:00
- Helge Ebhard: A simple and practical linear-work parallel algorithm for connectivity
- Jerome Urhausen: Parallel shortest-paths using radius stepping
- Roland Osterrieter: Randomized routing and sorting on fixed-connection networks
- Oliver Plate: Ordering heuristics for parallel graph coloring
- Daniel Ferizovic: Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
- Lasse Wulf: Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
- Benedict Toussaint: Parallel Heap: An Optimal Parallel Priority Queue
- Artem Titarenko: An Optimal Parallel Algorithm for Integer Sorting
- Sebastian Bayer: Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Pruefungstermine: 20.2., 12.4., 8.5. bitte Zeitpunkt per email ausmachen