|
CS 590PA: Parallel Algorithms Course Objective: Enable students to learn the design and analysis techniques for parallel computation. Covered parallel computation models, basic techniques, summation, prefix, linked lists and trees, finding minimum, selection, merging, sorting, connected components, shortest path, matrix multiplication, etc.. Course Description: This course was an introductory course of the design and analysis of parallel algorithms. It covered parallel computation models, parallel algorithm design and analysis techniques. Most problems treated in this course were simple problems in sequential algorithm course. Yet for the parallel algorithm design they are not trivial. Many of the techniques covered in the course were surprisingly simple yet very elegant. We learnt the methodologies, design paradigms and analysis techniques through selected examples.
Textbook:
Assignments and Tests (My views) This course really spoiled all my weekends during the semester :) I really mean it !! Most of the assignments given to us in this course looked IMPOSSIBLE. I managed to solve most of them, but at the cost of my weekends :(. I am posting all my assignment and test question answers. Most of them are correct.
Assignment 1
|