CS 5260 - Parallel Computations

Architecture, synchronization and communication aspects of parallel and distributed systems. This course will focus on the design and analysis of parallel algorithms with a prototype treatment on current machines. The 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 with a grade of “C” or better.

Credits: 3 hours

Notes: Open to upperclass and graduate students. Undergraduates with junior or senior status who have met the specific course Prerequisites or have the permission of the instructor may enroll in 5000-level courses.