The study of intrinsic parallelism in computational problems and the design of fast and efficient parallel algorithms. Parallel algorithms for prefix computation, selection, merging, sorting, routing, arithmetic, graph, and systolic algorithms.
Prefix:
CS
Course Number:
676
Credits:
3.0