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

2. 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. 3 A simple parallel algorithm

4. 4 Analysis of parallel algorithms

5. 5 (Sequential lower bound)

6. 6 A work-optimal algorithm

7. 7

8. 8 The PRAM Model

9. 9

10. 10 Classification of the PRAM model

11. 11 Classification of the PRAM model

12. 12 Models of parallel computation

13. 13 The SIMD model

14. 14 Design Issues

15. 15 Architectures Hypercube

16. 16 Adding n numbers on the mesh

17. 17 Adding n numbers on the hypercube

18. 18 Parallel Searching, Merging and Sorting

19. 19 A parallel search algorithm

20. 20 Example

21. 21 Example

22. 22 Example

23. 23 A parallel merge algorithm

24. 24 A parallel merge algorithm

25. 25 Ranking a short sequence in a sorted sequence

26. 26 A fast merging algorithm

27. 27 A fast merging algorithm

28. 28 Ranking a sample of elements

29. 29 A fast merging algorithm

30. 30 A fast merging algorithm

31. 31 A example

32. 32 A fast merging algorithm

33. 33 Complexity

34. 34 An optimal merging algorithm

35. 35 Taking the samples

36. 36 An efficient sorting algorithm

37. 37 The sequential merge sort algorithm

38. 38 An efficient sorting algorithm

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