4003-532-70/4005-736-70 Parallel Computing II Course Schedule and Topics Prof. Alan Kaminsky -- Spring Quarter 2007 Rochester Institute of Technology -- Department of Computer Science Time: Mondays and Wednesdays, 6:00pm-7:50pm, Room 70-1610 Final Exam: Monday, 21-May-2007, 6:00pm-8:00pm, Room 70-1610 Sun Mon Tue Wed Thu Fri Sat Mar. 11 Mar. 12 Introduction   Mar. 13 Mar. 14 Module 1. Basic Parallel Programming Mar. 15 Mar. 16 Mar. 17 Mar. 18 Mar. 19 -- Drop/add deadline* Module 1. Basic Parallel Programming Programming Project 1 assigned Mar. 20 Mar. 21 Module 2. Hybrid SMP Cluster Pgmg. Mar. 22 Mar. 23 Mar. 24 Mar. 25 Mar. 26 Guest Lecture -- Prof. Hans-Peter Bischof Spiegel and GrapeCluster Mar. 27 Mar. 28 Class canceled*** Mar. 29 Mar. 30 Mar. 31 Apr. 1 Apr. 2 Module 2. Hybrid SMP Cluster Pgmg.   Apr. 3 Apr. 4 Teams 1-4 Presentations -- Report 1 Apr. 5 Apr. 6 Apr. 7 Apr. 8 Apr. 9 Module 2. Hybrid SMP Cluster Pgmg. Programming Project 1 due Apr. 10 Apr. 11 Teams 1-2 Presentations -- Report 2 Apr. 12 Apr. 13 Apr. 14 Apr. 15 Apr. 16 Case Study 1. Phylogenetic Trees Programming Project 2 assigned Apr. 17 Apr. 18 Teams 3-4 Presentations -- Report 2 Apr. 19 Apr. 20 Last Day to W** Apr. 21 Apr. 22 Apr. 23 Case Study 1. Phylogenetic Trees   Apr. 24 Apr. 25 Teams 1-2 Presentations -- Report 3 Apr. 26 Apr. 27 Apr. 28 Apr. 29 Apr. 30 Class canceled   May 1 May 2 Teams 3-4 Presentations -- Report 3 May 3 May 4 May 5 May 6 May 7 Case Study 1. Phylogenetic Trees Programming Project 2 due May 8 May 9 Teams 1-2 Presentations -- Report 4 May 10 May 11 May 12 May 13 May 14 Case Study 2. Lock-Free Concurrent Programming May 15 May 16 Teams 3-4 Presentations -- Report 4 Team deliverables due May 17 May 18 May 19 Finals May 20 May 21 Final Exam 6:00pm-8:00pm Room 70-1610 May 22 Finals May 23 Finals May 24 Finals May 25 May 26 *Last date to drop/add courses: Monday 19-Mar-2007 **Last date to withdraw with a grade of W: Friday 20-Apr-2007 **Last date to request final exam rescheduling due to scheduling conflicts: Friday 20-Apr-2007 ***I will be out of town the week of 26-Mar-2007 attending the IPDPS 2007 conference. Introduction Topics Course introduction Course policies Reading Course Description and Objectives Course Grading and Policies Module 1. Basic Parallel Programming Topics Review of parallel programming concepts SMP parallel programming; OpenMP Cluster parallel programming; MPI Parallel Java (PJ) Reading Kaminsky, Building Parallel Programs Parallel Computing I Lecture Notes Random Walk Module 2. Hybrid SMP Cluster Programming Topics Hybrid SMP cluster architecture Hybrid SMP cluster programming with PJ Hybrid SMP cluster programming with OpenMP/MPI Measuring performance on a hybrid SMP cluster Reading Massively Parallel Problems Load Balancing N-Bodies Problem With Visualization Parallel Datastore Querying Case Study 1. Phylogenetic Trees Topics Computational biology problems Phylogenetic tree construction; maximum parsimony Branch and bound algorithms Parallel branch and bound algorithms Parallel maximum parsimony phylogenetic tree construction Reading Concepts Building Blocks Exhaustive Search Case Study 2. Lock-Free Concurrent Programming Topics Atomic compare-and-set Lock-free concurrent data structures Java support Reading Lock-Free Concurrent Programming Parallel Computing II • 4003-532-70/4005-736-70 • Spring Quarter 2007 Course Page Alan Kaminsky • Department of Computer Science • Rochester Institute of Technology • 4486 + 2220 = 6706 Home Page Copyright © 2007 Alan Kaminsky. All rights reserved. Last updated 14-May-2007. Please send comments to ark­@­cs.rit.edu.