Parallel Algorithms
The course will focus on the design, implementation, and analysis of a parallel solution to an interesting problem on a state-of-the-art high-end computing system. The students will learn how to program contemporary shared-memory, distributed-memory, and GPGPU-based high-end computing systems. The course will also cover the design and analysis of fundamental parallel algorithms. Time and space complexity of solutions to problems from areas that include computational geometry, image analysis, and graph theory will be considered. Architectures include the PRAM, mesh, pyramid, mesh-of-trees, and hypercube.
None presently available.
Ph.D.:
This course does not fulfill core area or core course requirements.
M.S.:
This course fulfills one Theory/Algorithms Core Area requirement.
CSE 531
| Semester | Section | Title | Instructor | Credit Hours | Enrolled |
|---|---|---|---|---|---|
| Fall 2012 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 19/30 |
| Fall 2011 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 15/30 |
| Fall 2010 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 13/30 |
| Spring 2010 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 0/ 0 |
| Spring 2010 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 0/15 |
| Spring 2009 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 8/30 |
| Spring 2008 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 4/30 |
| Spring 2007 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 5/30 |
| Spring 2006 | LEC | Parallel Algorithms | Dr. Russ Miller | 3 | 0/ 0 |