Planned and Completed Lecture Topics S 2011
1. 3/29/11. Intrduction: parallelism and parallel algorithms (chap. 1 text), paralle models. PRAM models, summation example, Work Depth model
the class NC (chapter 2).
2. 3/31/11 Parallel Prefix (chapter 3); chapter 4 merging: partitioning 4.1
3. 4/5/11 Merge sort (4.2), bitonic sort (Cormen, Leiserson, Rivest 2nd edition 27.3, web link:
bitonic sort link
Start 5: Accelerating Cascades.
4. 4/7/11 Selection algorithm by reduction (4.2), informal work-depth approach. 5.1 Integer sorting.
5. 4/12/11 2-3 Trees and pipelining: parallel insert and delete (7)
6 4/14/11 Maximum Finding (8)
7.4/19/11 List Ranking applications: Euler tours, tree rooting, preorder numbers: 9.1
8. 4/21/11 List Ranking Algorithms, symmetry breaking: 9.2, 9.3, randomized algorithm: 9.4
9. 4/26/11 Ps1 solutions (summary). Wrap up 9.4, Deterministic List Ranking, 9.5, Optimal 2-ruling set algorithm, 9.6
10. 4/28/11 Tree contraction, 10.
11. 5/3/11 Midterm
12. 5/5/11 Midterm Solutions, Connectivity: basics (11), a first algorithm 11.1
13. 5/10/11 Guest Lecture, John Owens, GPU algorithms
14. 5/12/11 Guest Lecture, John Owens, more on GPU algorithms
15. 5/17/11 Recap on GPU's and PRAMs. Connectivity continued, implementation issues and analysis 11.1, improved alogorthm 11.2
16 5/19/11 More details on the better connectivity algorithm, Minimum spanning forests (11.3), PRAM model comparison
17 5/24/11 Parallel quicksort (paper in resources on smartsite). Random writes and selection resolution, another reference is:
Parallel quicksort, by Chlebus and Vr,
Journal of Parallel and Distributed Computing
Volume 11, Issue 4, April 1991, Pages 332-337
18 5/26/11 Parallel Max Flow (Goldberg's algorithm): Kleinberg-Tardos for serial algorithm and max-flow chapter of thesis on smartsite under resources.
19 5/31/11 Max-Flow experiments, Parallel BFS, XMT architecture/programming model, Review
20 6/2/11 Midterm II, Open notes, comprehensive