Parallel Computing: Lecture 19

Learning objectives

After this class, you should be able to:

1. Explain the different approaches to parallelizing divide and conquer algorithms and back-tracking algorithms.
2. Given a problem, use one of the above approaches to design a parallel algorithm for it, and analyze the time complexity.

Reading assignment

1. Chapter 16, up to (and including) section 16.4.
2. None.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 16.1.
  2. Exercise 16.16. You need not benchmark your program. But give solutions for small values of N.

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