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

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/26 Course introduction    
Th   Fundamentals of parallel computing    
2 Tu 9/2 Models of parallel computing    
Th   Performance analysis    
3 Tu 9/9 Introduction to MPI: communication primitives Project 1
(n/w parameters)
 
Th   Collective primitives    
4 Tu 9/16 Project 2
(Conway's Game of Life)
Th   No class due to instructor travel    
5 Tu 9/23 Intraconnection networks & embeddings    
Th        
6 Tu 9/30 Matrix algorithms: MxV, MxM (Cannon's algo)    
Th        
7 Tu 10/7 Parallel prefix and applications    
Th     Project 3
(Random number gen.)
 
8 Tu 10/14 Sorting (bitonic sort)    
Th        
9 Tu 10/21 Transportation primitives    
Th   Sorting (sample sort) Project 4
(sample sort)
 
10 Tu 10/28      
Th        
11 Tu 11/4 Multithreading & OpenMP programming    
Th   Multithreaded algorithms: sorting, graph methods Project 5
(Pi estimation/MxV)
 
12 Tu 11/11 Veteran's day (no class)    
Th   Multithreaded algorithms: sorting, graph methods Project 6
(page rank est.)
 
13 Tu 11/18      
Th   Midterm exam    
  Tu 11/25 Thanksgiving week (no class)    
Th      
14 Tu 12/2 MapReduce algorithms and Cloud computing    
Th        
15 Tu 12/9      
Th        
  Tu 12/16 Final exam week (Friday noon, white paper due online)    
Th

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