CS 509 - Parallel Algorithms - 3 credit hours


Design and analysis of parallel algorithms using the PRAM model, with emphasis on graph algorithms, searching and sorting, and linear algebra applications. Embedding into hypercubic and related networks. Introduction to parallel complexity theory.

Prerequisites: CS 461 or EECE 537 (Foundations of Computing); CS 442/EECE 432 (Intro. to Parallel Processing).

(Also offered as EECE 509).