Difference between revisions of "GPU610/SSD"
HolyHazard (talk | contribs) |
HolyHazard (talk | contribs) (→Assignment 1) |
||
Line 11: | Line 11: | ||
=== Assignment 1 === | === Assignment 1 === | ||
+ | Sezar: | ||
+ | |||
+ | ---- | ||
+ | Dylan: | ||
+ | |||
+ | ---- | ||
+ | Stephanie: | ||
+ | |||
+ | For assignment one I profiled a closest pair algorithm. The source code can be found here: | ||
+ | |||
+ | ''[http://rosettacode.org/wiki/Closest-pair_problem/C http://rosettacode.org/wiki/Closest-pair_problem/C]'' | ||
+ | |||
+ | I was able to run the code successfully on Matrix and I believe it is a good candidate to parallelize. The closest() function generally eats up the most time and I believe that most of its remedial processes could be done by the GPU. | ||
+ | |||
+ | ''A useful reference site to help explain closest pair algorithms: | ||
+ | |||
+ | [http://www.algorithmist.com/index.php/Closest_Pair http://www.algorithmist.com/index.php/Closest_Pair]'' | ||
+ | |||
+ | ---- | ||
+ | |||
=== Assignment 2 === | === Assignment 2 === | ||
=== Assignment 3 === | === Assignment 3 === |
Revision as of 00:19, 8 February 2013
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
Project Name TBA
Team Members
Progress
Assignment 1
Sezar:
Dylan:
Stephanie:
For assignment one I profiled a closest pair algorithm. The source code can be found here:
http://rosettacode.org/wiki/Closest-pair_problem/C
I was able to run the code successfully on Matrix and I believe it is a good candidate to parallelize. The closest() function generally eats up the most time and I believe that most of its remedial processes could be done by the GPU.
A useful reference site to help explain closest pair algorithms:
http://www.algorithmist.com/index.php/Closest_Pair