Parallel Computing: Lecture 17
Learning objectives
After this class, you should be able to:
- Explain the steps of the parallel finite difference algorithm for the vibrating string problem.
- Analyze the time complexity of the above algorithm (i) with and without overlap of communication and computation, and (ii) with and without redundant computations.
- Give the iso-efficiency and scalability functions for each of the above cases.
- Given a similar problem, give a parallel algorithm for it and analyze it.
Reading assignment
- Chapter 13, section 13.3.
- Review quicksort from a book on algorithms.
Exercises and review questions
- Questions on current lecture's material
- Exercise 13.7. Analyze its time complexity too.
- Questions on next lecture's material
- (Post your solution on the discussion board) Show the steps taken by quicksort to sort the following array, if the last element is used as the pivot each time:
2, 8, 3, 4, 5, 1, 6.