| |
Apr 18, 2024
|
|
|
|
|
CS 4120 - Parallel Computing I
Studies different parallel structures to familiarize students with 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. Advantages and disadvantages of different methods for mapping algorithms onto several different paralllel architecture studied. Algorithms discussed include sorting, searching, matrix operations, and others.
Requisites: CS 3610 and 4000
Credit Hours: 3.0
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I
Add to Portfolio (opens a new window)
|
|
