CS 5260 - Parallel Computations I

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

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.