Computer Systems Lectures for Fall 2012
|
Lecture |
Date |
Topics |
Overheads |
Handouts |
|---|---|---|---|---|
|
01 |
Aug 21 |
Computer Org/Architecture Overview |
|
|
|
02 |
Aug 23 |
Ch. 1: Parallel programming example |
|
|
|
03 |
Aug 28 |
Ch. 2: Parallel Computer diversity |
|
|
|
04 |
Aug 30 |
Ch. 2: Abstract Parallel Computer Models: PRAM and CTA |
|
|
|
05 |
Sept 4 |
Ch. 3: Parallel Performance |
|
|
|
06 |
Sept 6 |
Ch. 4: Formulating Parallelism in Peril-L |
|
|
|
07 |
Sept 11 |
Ch. 4: Unlimited, fixed, and scalable Parallelism Examples |
|
|
|
08 |
Sept 13 |
Ch. 5: Scalable Algorithmic Techniques |
|
|
|
09 |
Sept 18 |
Ch. 5: Dynamic Allocation of work and trees; Ch 6. Pthreads Introduction |
|
|
|
10 |
Sept 20 |
Ch 6. Synchronization using condition variable, monitors |
|
|
|
11 |
Sept 25 |
Ch 6. Pthread examples |
|
|
|
12 |
Sept 27 |
Ch 6. Pthread debugging |
|
|
|
13 |
Oct 02 |
Ch 7. MPI Introduction |
||
|
14 |
Oct 04 |
Ch 7. MPI Communicators and groups; 2D SOR Example code |
|
|
|
15 |
Oct 09 |
Review for Test 1 |
|
|
|
16 |
Oct 11 |
Test 1 |
|
|
|
17 |
Oct 16 |
Return Test and MPI compile, exec lab |
||
|
18 |
Oct 18 |
Introduction to CUDA |
Dan Negrut UW-Slides (pp. 209+) |
|
|
19 |
Oct 23 |
CUDA count 3s example |
||
|
20 |
Oct 25 |
|
|
|
|
21 |
Oct 30 |
CUDA Count 3s Examples |
|
|
|
22 |
Nov 01 |
Tree search: TSP Example |
|
|
|
23 |
Nov 06 |
Wright Hall lab debugging |
|
|
|
24 |
Nov 08 |
TSP Parallel Implementations |
||
|
25 |
Nov 13 |
TSP Parallel Implementations |
||
|
26 |
Nov 15 |
In classroom work day |
|
|
|
Thanksgiving Break November 17 - 25 |
||||
|
27 |
Nov 27 |
TSP Cuda Parallel Implementations |
||
|
28 |
Nov 29 |
HW #5 Cuda 2-D SOR |
|
|
|
29 |
Dec 04 |
TSP Cuda Implementation |
|
|
|
30 |
Dec 06 |
Review for Final Exam |
|
|
|
Final Exam, Wednesday (December 12) 1:00-2:50 PM in ITT 322 |
||||