Parallel Computing: Lecture 18

Learning objectives

After this class, you should be able to:

1. Explain the steps of the three parallel sorting algorithms discussed in class.
2. Analyze the time complexities of the above algorithms.
3. Give the iso-efficiency and scalability functions for the above algorithms.
4. Given other algorithms for sorting, parallelize them, analyze their time complexities, and give their iso-efficiency and scalability functions.

Reading assignment

1. Chapter 14.
2. None.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 14.9 a, b, c.

• Questions on next lecture's material
  1. None.