credits: 3
level: postgraduate
condition: none
Week | Topic | Chapter |
1 (3/6) | Introduction, course outline, texts, references, grading, computer facilities | |
2 (10/6) | Parallel Computers |
|
3 (17/6) | Message Passing Computing |
|
4 (24/6) | Embarrassingly Parallel Computation |
|
5 (1/7) | Partitioning and Divide-and-Conquer Strategies |
|
6 (8/7) | Pipelined Computations |
|
7 (15/7) | Synchronous Computations |
|
8 (22/7) | --Midterm Exam-- | |
9 (29/8) | Load Balancing and Termination Detection |
|
10 (5/8) | Programming with Shared Memory |
|
11 (12/8) | --Holiday (Mother Day)-- | |
12 (19/8) | Sorting Algorithms |
|
13 (26/8) | Numerical Algorithms |
|
14 (2/9) | Searching and Optimization |
|
15 (9/9) | High Throughput Computing | |
16 (16/9) | Other Parallel Computation Models | |
17 | --Final Exam ()-- |
Note: The schedule may be adjusted during the course. Some sections of the text may be omitted.