1 / 39

Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms)

Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms). Robin Pomplun. Overview. A simple parallel algorithm Analysis of parallel algorithms The PRAM model The SIMD model A parallel Search Algorithm A Fast Merging Algorithm An efficient Sorting Algorithm.

jamese
Télécharger la présentation

Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Vorlesung Informatik 2Algorithmen und Datenstrukturen(Parallel Algorithms) Robin Pomplun

  2. Overview • A simple parallel algorithm • Analysis of parallel algorithms • The PRAM model • The SIMD model • A parallel Search Algorithm • A Fast Merging Algorithm • An efficient Sorting Algorithm

  3. A simple parallel algorithm

  4. Analysis of parallel algorithms

  5. Analysis of parallel algorithms (Sequential lower bound)

  6. A work-optimal algorithm

  7. A work-optimal algorithm

  8. The PRAM Model

  9. The PRAM Model

  10. Classification of the PRAM model

  11. Classification of the PRAM model

  12. Models of parallel computation

  13. The SIMD model

  14. Design Issues

  15. Architectures Hypercube

  16. Adding n numbers on the mesh

  17. Adding n numbers on the hypercube

  18. Parallel Searching, Merging and Sorting

  19. A parallel search algorithm

  20. Example

  21. Example

  22. Example

  23. A parallel merge algorithm

  24. A parallel merge algorithm

  25. Ranking a short sequence in a sorted sequence

  26. A fast merging algorithm

  27. A fast merging algorithm

  28. Ranking a sample of elements

  29. A fast merging algorithm

  30. A fast merging algorithm

  31. A example

  32. A fast merging algorithm

  33. Complexity

  34. An optimal merging algorithm

  35. Taking the samples

  36. An efficient sorting algorithm

  37. The sequential merge sort algorithm

  38. An efficient sorting algorithm

  39. ENDE Danke für Ihre Aufmerksamkeit !!!

More Related