Lecture Time and Location. TuTh 2:30 pm - 3:50 pm, Melville Library W4540, West Campus
Instructor. Rezaul A. Chowdhury (rezaul{at}cs{dot}stonybrook{dot}edu)
Office Hours. TuTh 12:30 pm - 2:00 pm, 1421 Computer Science Building
TA. Vikas Ganjigunte Ashok (vganjiguntea{at}cs{dot}stonybrook{dot}edu)
Office Hours. Tu 4:00 pm - 5:00 pm, 2110 Computer Science Building (TA Room)
Course Description. We will explore various topics in the following three areas:
The course will be supported by an educational grant from XSEDE (Extreme Science and Engineering Discovery Environment). We will use the computing resources provided by XSEDE for homework problems and projects.
Prerequisites. Background in algorithms analysis (e.g., CSE 548) and programming languages (e.g., C/C++) is required (or consent of instructor).
Textbooks. All are recommended, but none is required.
Course Requirements. There will be 3 homework assignments, one in-class final exam, and one project. Each student will be responsible for scribing one lecture. The course grade will be based on the following.
Blackboard. Some course documents (e.g., scribe notes, homework solutions, etc.) will be available through Blackboard.
Lecture Schedule.
Date | Topic | Notes / Reading Material |
Tue, Jan 29 | Introduction | - |
Thu, Jan 31 | Analytical Modeling of Parallel Algorithms |
|
Tue, Feb 5 | Analytical Modeling of Parallel Algorithms ( Continued ) |
|
Thu, Feb 7 | Analytical Modeling of Parallel Algorithms ( Continued ) |
|
Tue, Feb 12 | The Cilk++ Concurrency Platform |
|
Thu, Feb 14 | Analysis of a Work Stealing Scheduler |
|
Tue, Feb 19 | Analysis of a Work Stealing Scheduler ( Continued ) |
|
Thu, Feb 21 | Parallel Quicksort and Selection |
|
Tue, Feb 26 | Parallel Quicksort and Selection ( Continued ) |
|
Thu, Feb 28 | Parallel Connected Components |
|
Tue, Mar 5 | Parallel Connected Components ( Continued ) |
- |
Thu, Mar 7 | Parallel Minimum Spanning Trees (and Radix Sort & Counting Sort) |
|
Tue, Mar 12 | Parallel Minimum Spanning Trees (and Radix Sort & Counting Sort) |
|
Thu, Mar 14 | Parallel Maximal Independent Set |
|
Tue, Mar 19 | Spring Break | - |
Thu, Mar 21 | Spring Break | - |
Tue, Mar 26 | Parallel Maximal Independent Set ( Continued ) |
|
Thu, Mar 28 | "Resilient Algorithms" by Anirban Mitra and Akassh Mishra ( Part 1 and Part 2 ) |
- |
Tue, Apr 2 | Project Progress Report ( Presentation ) | - |
Thu, Apr 4 | Project Progress Report ( Presentation ) | - |
Tue, Apr 9 | Project Progress Report ( Presentation ) | - |
Thu, Apr 11 | "Streaming Algorithms" by Ajinkya Potdar and Hemanga Borah ( Entire Presentation ) |
- |
Tue, Apr 16 | Analyzing I/O and Cache Performance |
|
Thu, Apr 18 | Analyzing I/O and Cache Performance ( Continued ) | - |
Tue, Apr 23 | Cache-efficient Searching and Sorting |
|
Thu, Apr 25 | Cache-efficient Searching and Sorting ( Continued ) |
|
Tue, Apr 30 | Cache-oblivious Priority Queue with Decrease-Keys |
|
Thu, May 2 | Cache-oblivious Priority Queue with Decrease-Keys ( Continued ) |
|
Tue, May 7 | - | - |
Thu, May 9 | Final Exam | - |
Homeworks.
Exam.