3 Credit Hour Course
Intended For Level 0 Term 0 Students
Prerequisite:
Introduction, Parallel processing, Parallel models, Performance of Parallel Algorithms, The work-time presentation framework, Basic techniques: Pointer jumping, Balanced trees, Divide and Conquer, Pipelining, Partitioning and symmetry breaking, List ranking, Euler-Tour technique, Tree contraction; Parallel searching, merging, sorting and selection, Connected components, Minimum spanning trees, Biconnected Components, Directed graphs, Plane sweeping, Visibility problems, Simulation between PRAM models, Lower hounds for EREW, CREW and CRCW PRAMs.
