Tentative Schedule for CPT S 483: An Introduction to Parallel Computing (Fall 2016)

The following schedule is only tentative and is subject to (most likely, significantly!) change as the course progresses. So please keep a tab.

Week Day Date Topic

Assignments*

Posting date Due date
1 Tu 8/23 Course introduction    
Th   Fundamentals of parallel computing    
2 Tu 8/30 No Class - Instructor Travel    
Th   Models of parallel computing; Performance analysis    
3 Tu 9/6 Introduction to MPI: communication primitives

 
Th  
Project 1
(n/w parameters)
Homework
 
4 Tu 9/13 MPI Collective primitives

Th  
 Homework  
5 Tu 9/20 Inter-connection networks & embeddings
 
Th     Project 2 (GoL)  
6 Tu 9/27 Matrix algorithms: MxV, MxM (Cannon's algo)  Homework  
Th        
7 Tu 10/4 No Class - Instructor Travel    
Th   Parallel prefix and applications
 
8 Tu 10/11 Sorting (bitonic sort)
Project 2
Th        
9 Tu 10/18 Transportation primitives Project 3  
Th   Sorting (sample sort)
 
10 Tu 10/25
 Project 4  
Th   No Class - Instructor Travel    
11 Tu 11/1 White Paper discussion in class     
Th   Multithreading & OpenMP programming
 
12 Tu 11/8 No class due to instrutor travel. Work on white paper formulation. Project 5  
Th   Multithreaded algorithms: sorting, graph methods
 
13 Tu 11/15   Project 6
 
Th   Midterm exam    
  Tu 11/22 Thanksgiving week (no class)    
Th      
14 Tu 11/29 MapReduce algorithms and Cloud computing    
Th    White Paper Presentations    
15 Tu 12/6  White Paper Presentations    
Th        
  Tu 12/13 Final White Paper due by Thursday (December 15, 2016) @ NOON PDT.     
Th


* Homework & project links will be activated on their posting dates.