Catalog Course Description

<Formerly 292K>. Fundamental theoretical issues in designing parallel algorithms and architectures. Shared memory models of parallel computation. Parallel algorithms for linear algegra, sorting, Fourier Transform, recurrence evaluation, and graph problems. Interconnection network based models. Algorithm design techniques for networks like hypercubes, shuffle-exchanges, threes, meshes and butterfly networks. Systolic arrays and techniques for generating them. Message routing.

Fall Term

3 hours of Instructor presentation of course materials per week and 6 hours of Outside Work Hours per week.

Spring Term

3 hours of Instructor presentation of course materials per week and 6 hours of Outside Work Hours per week.