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

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/25 Course introduction    
Th   Fundamentals of parallel computing    
2 Tu 9/1 Models of parallel computing    
Th   Performance analysis    
3 Tu 9/8 Introduction to MPI: communication primitives
(TA will present)		 Project 1
(n/w parameters)		  
Th   Instructor travel - no class. Students expected to work on project. TA will be available.     
4 Tu 9/15 MPI Collective primitives Project 2
(Conway's Game of Life)
Th  
   
5 Tu 9/22 Intraconnection networks & embeddings    
Th        
6 Tu 9/29 Matrix algorithms: MxV, MxM (Cannon's algo)    
Th        
7 Tu 10/6 Parallel prefix and applications    
Th    
 
8 Tu 10/13 Sorting (bitonic sort) Project 3
(Random number gen.) 		 
Th        
9 Tu 10/20 Transportation primitives    
Th   Sorting (sample sort)
 
10 Tu 10/27  NO CLASS - INSTRUCTOR TRAVEL  Project 4 (sample sort)  
Th   Multithreading & OpenMP programming    
11 Tu 11/3 White Paper discussion in class    
Th  

 
12 Tu 11/10 Multithreaded algorithms: sorting, graph methods Project 5
(Pi estimation/MxV) 		 
Th  

 
13 Tu 11/17   Project 6
(page rank est.) 		 
Th   Midterm exam    
  Tu 11/24 Thanksgiving week (no class)    
Th      
14 Tu 12/1 MapReduce algorithms and Cloud computing    
Th        
15 Tu 12/8      
Th        
  Tu 12/15 Final White Paper due by Tuesday (December 15, 2015) @ NOON PDT.     
Th


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