MA3261 Basic Parallel Computation
The course has two goals: First, to introduce fundamental issues such as shared vs. distributed memory, connection topologies, communication algorithms, speedup, efficiency, storage requirements, granularity, pipelining, problem scaling, and useful paradigms for algorithm development. Second, to develop working proficiency by designing, implementing, and evaluating the performance of several parallel algorithms. These include, but are not limited to, numerical quadrature, matrix computations, sorting, network analysis, and dynamic programming.
Prerequisite
MA1115 or
MA3025 and ability to program in a high-level language
Lecture Hours
3
Lab Hours
0