Differences
This shows you the differences between two versions of the page.
fischer:teaching:pa-ss2019 [2019-02-02 09:25] |
fischer:teaching:pa-ss2019 [2019-02-02 09:25] |
||
---|---|---|---|
Line 9: | Line 9: | ||
===== Themenliste ===== | ===== Themenliste ===== | ||
- | ==== Einführung ==== | + | [s. Moodle] |
- | * 1. Maschinenmodelle: McCool et al. Kap. 2.4-2.6 OHNE 2.5 | + | |
- | * 2. Performanzmessung: McCool et al. Kap. 2.5 und Dietzfelbinger et al. Kap. 2.10 und McCool et al. 2.5.6 | + | |
- | * 3. PRAM: Dietzfelbinger et al. Kap. 2.4.1, Cormen et al. Kap. 27.1 | + | |
- | * 4. BSP/Distributed Memory: Dietzfelbinger et al. Kap. 2.4.2-2.4.3 und 3.1 | + | |
- | ==== Grundlegende Algorithmen ==== | + | |
- | * 5. Präfixsumme: Blelloch 1.1-1.2 | + | |
- | * 6. List-Ranking: Dietzfelbinger et al. Kap. 3.3 | + | |
- | * 7. Hashing: Dietzfelbinger et al. Kap. 4.6 | + | |
- | * 8. Selection: Dietzfelbinger et al. Kap. 5.8-5.9 | + | |
- | * 9. Queues und Prioritätswarteschlangen: Dietzfelbinger et al. Kap. 3.7 und 6.4 | + | |
- | ==== Sortieralgorithmen ==== | + | |
- | * 10. Quicksort: Dietzfelbinger et al. Kap. 5.7 | + | |
- | * 11. Mergesort: Cormen et al. Kap. 27.3 und Dietzfelbinger et al. Kap. 5.14 | + | |
- | * 12. Sample Sort: Dietzfelbinger et al. Kap. 5.13 und McCool et al. Kap. 14 | + | |
- | + | ||
- | ==== Graphalgorithmen ==== | + | |
- | * 13. Breitensuche: Dietzfelbinger et al. Kap. 9.2 | + | |
- | * 14. DAG-Traversal: Dietzfelbinger et al. Kap. 9.4 | + | |
- | * 15. Minimum Spanning Trees: Dietzfelbinger et al. Kap. 11.6 | + | |
- | + | ||
- | ==== Kommunikation ==== | + | |
- | * 16. Dietzfelbinger et al. Kap. 13.1-13.3 | + | |
- | * 17. Dietzfelbinger et al. Kap. 13.4-13.6 | + | |
- | + | ||
- | ==== Lastbalancierung ==== | + | |
- | * 18. Dietzfelbinger et al. Kap. 14.1-14.3 | + | |
- | * 19. Dietzfelbinger et al. Kap. 14.4-14.5 | + | |