Parallel Computing: Lecture 24

Learning objectives

After this class, you should be able to:

1. Given a graph, show how each of the following algorithms will bisect it: (i) Levelized Nested Dissection, (ii) the simple multi-level method described in class.
2. Given an array of cells, show how the Hilbert space-filling curve will traverse the cells.

Reading assignment

1. Slides on load balancing.
2. Prepare for the midterm exam!

Exercises and review questions

• Questions on current lecture's material
  1. (Post your solution on the discussion board) Consider an 8x8 array of cells, which are numbered in row-major order. Give the order in which the cells are visited by the Hilbert space-filling curve.
  2. Complete the Levelized Nested Dissection example given in class.
  3. Complete the multilevel method example given in class.

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