Catalog 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.

Units: 3

Prerequisites: COMPSCI 170, or consent of instructor.

Formats:
Fall: 3.0 hours of lecture per week
Spring: 3.0 hours of lecture per week

Grading basis: letter

Final exam status: Written final exam conducted during the scheduled final exam period

---

Class homepage on inst.eecs

Related Areas:

• Theory (THY)