rachelburke / cs452

CS452 - Parallel Algorithms

CS452 - Parallel Algorithms - C++ with MPI

Professor: Dr. Ankur Gupta
Jan - May 2019

This repository contains files from my CS452 course taken in the Spring of 2019 at Butler University. It contains course notes, and projects.

Course Description

A study of theoretical and practical paradigms of parallel algorithm design. Topics include model costs, lower bounds, architecture and topology, data-parallelism, synchronization, transactional memory, message passing, and parallel design for sorting, graphs, string processing, and dynamic programming. Prerequisite: CS 351(U)(3)

Course Topics

1. Introduction, Parallel Models, Lower Bounds
2. General Techniques for Parallelism
3. Lists and Trees
4. Searching, Sorting, Selecting, and Merging
5. Graphs and Planar (Computational) Geometry
6. String Processing
7. Complex Mathematical Computation (FTT, Recurences)

Course Projects

1. Relay Race (Parallel)
2. Max, Min, and Average (Parallel)
3. String Letter Counter (Parallel)
4. Mergesort (Sequential)
5. Mergesort (Parallel)
6. 2-3 Trees (Sequential)