CS 5260 - Parallel Computations I

Parallel Computations I will cover architecture, synchronization and communication aspects of parallel and distributed systems. This course will focus on the design and analysis of algorithms which have a prototype treatment on current machines. These algorithms may include parallel sorting, combinatorial search, graph search and traversal, applications in graphics, 2-D finite differences, 2-D finite element techniques, matrix algorithms and the Fast Fourier Transform.

Prerequisites & Corequisites: Prerequisite: CS 3310.

Credits: 3 hours