 |
Enabling Researcher-Driven Innovation and Exploration |
 |
||||
 |
 |
 |
The following schedule is subject to change. Lecture notes usually will be posted after the class.
-
Week Date Topic Lecture notes Instructor 1 1/9 Course introduction lec01.pdf Roth 1/11 Motivation and scope of parallel computing lec02.pdf 2 1/14 Parallel computing platforms lec03.pdf 1/16 lec04.pdf 1/18 lec05.pdf 3 1/21 Performance models of parallel algorithms lec06.pdf 1/23 lec07.pdf 1/25 Parallel algorithm design principles lec08.pdf Shi 4 1/28 lec09.pdf 1/30 lec10.pdf 2/1 Communications lec11.pdf 5 2/4 lec12.pdf 2/6 lec13.pdf 2/8 Exam 1 6 2/11 Shared memory programming lec14.pdf Roth 2/13 lec15.pdf 2/15 lec16.pdf 7 2/18 lec17.pdf 2/20 lec18.pdf 2/22 lec19.pdf 8 2/25 Distributed memory programming lec20.pdf Shi 2/27 lec21.pdf 2/29 lec22.pdf 9 3/3 Spring break, no class 3/5 3/7 10 3/10 Distributed memory programming (cont.) lec23.pdf Shi 3/12 lec24.pdf 3/14 Review for exam 2 lec25.pdf 11 3/17 Exam 2 3/19 Sorting algorithms lec26.pdf Roth 3/21 lec27.pdf 12 3/24 lec28.pdf 3/26 Graph algorithms lec29.pdf 3/28 lec30.pdf 13 3/31 Search algorithms lec31.pdf 4/2 lec32.pdf 4/4 Dense matrix algorithms lec33.pdf Shi 14 4/7 lec34.pdf 4/9 lec35.pdf 4/11 Dynamic programming lec36.pdf 15 4/14 lec37.pdf 4/16 FFT lec38.pdf 4/18 Review for exam 3 lec39.pdf 16 4/21 Exam 3 
Last modified: April 18 2008 15:14:32 CST.
