| |
Dec 18, 2024
|
|
|
|
|
C S 412 - Parallel Computing
Studies different parallel structures to familiarize students with the variety of approaches to parallel computing and the strengths and weaknesses of each approach. Concentrates on understanding methods for developing parallel algorithms and analyzing their performance. The advantages and disadvantages of different methods for mapping algorithms onto several different parallel architectures will be studied. Algorithms discussed will include sorting, searching, and matrix operations.
Prerequisites: C S 361
Credit Hours: 5
Repeat/Retake Information: May be retaken three times excluding withdrawals, but only last course taken counts. Note: Effective Summer Quarter 2010-11 (June 2011) any non-repeatable course may be retaken two times excluding withdrawals, but only last course taken counts.
Add to Portfolio (opens a new window)
|
|
