MATH 8685. Parallel Algorithms-Design and Analysis

Course Code MATE 8685
Course Title Parallel Algorithms-Design and Analysis
Credits 3
Hours 3 per week
Prerequisites MATH 6682
Description Parallel architecture classifications. Parallel computational models. Network models such as arrays, trees, and hypercubes. Efficiency and scalability measures for parallel algorithms. Techniques of parallel algorithm design. Primitives for parallel algorithm design. Efficient parallel algorithms for integer and matrix computations, fast Fourier transform, sorting and graph problems. Algorithm mappings for network models. Data routing algorithms.
Additional Information