Difference between revisions of "GPU610/OctoPig"

From CDOT Wiki
Jump to: navigation, search
(Created page with '{{GPU610/DPS915 Index | 20131}} = Cosmosis = == Team Members == # [mailto:capilkey@myseneca.ca?subject=gpu610 Chad Pilkey] # [mailto:jtrobins@myseneca.ca?subject=gpu610 Justin …')
 
Line 1: Line 1:
 
{{GPU610/DPS915 Index | 20131}}
 
{{GPU610/DPS915 Index | 20131}}
= Cosmosis =
+
= TBA =
 
== Team Members ==  
 
== Team Members ==  
 
# [mailto:capilkey@myseneca.ca?subject=gpu610 Chad Pilkey]  
 
# [mailto:capilkey@myseneca.ca?subject=gpu610 Chad Pilkey]  
Line 9: Line 9:
 
== Progress ==
 
== Progress ==
 
=== Assignment 1 ===
 
=== Assignment 1 ===
We began by profiling two things: a string-comparison algorithm, and a program which develops quasi-random visuals from an initial seed.
+
We began by profiling two things: a string-comparison algorithm, and a program which develops quasi-random visuals from an initial seed using a Turing Machine algorithm.
  
  

Revision as of 23:52, 20 February 2013


GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary

TBA

Team Members

  1. Chad Pilkey
  2. Justin Robinson

subject=gpu610 Email All

Progress

Assignment 1

We began by profiling two things: a string-comparison algorithm, and a program which develops quasi-random visuals from an initial seed using a Turing Machine algorithm.


Justin's Findings

String comparison was not a good choice. If anything, it makes more sense to do string comparison in a serial fashion than in parallel. Comparing two strings of over 13,000 characters each in such a fashion as to force the algorithm to compare them all just barely results in a runtime of 0.001 seconds.


Chad's Profiling Findings

Chad, fill this in.


Analysis: Of our two selections, the choice to move forward with the pattern generator is clear.

Difficulties Met:

One apparent difficulty is the need to port the pattern-generator from Javascript into C in order to make use of CUDA.


Summary:

  • String comparison is not an efficient use of parallel programming practises.


Resources:


Assignment 2

Assignment 3