Changes

Jump to: navigation, search

GPU610/Turing

180 bytes added, 14:31, 15 October 2015
Progress
}
I believe there is potential at possibly parallelizing the nested for loop.
==== Chadd's Research ====
Data Decomposition is involves the dividing to a Large chunk a of Data into smaller sections of data. A processes is
then preformed on the smaller pieces of data until the entire chunk of data is processed or the programs end because
it has reached its goal.
==== Chadd's Example ====
[[Image:Data Decomp.png|600px ]]
the user. The program also counts the number of lines in the file and the number of matches found in the file.
=== Paralyse Nested Loops = Potential for parallelism ====
[[Image:loop.png|600px ]]
I think by parallelising making the nested loop above parallel I should be able to
produce a more efficient program. This section of the code uses a
majority of the CPU's power. This is where the program is actually
[[Image:profile2.png|600px ]]
 
 
==== Conclusion ====
We have decided to use the diffusion equation code for assignment 2 because it uses simple matrixes, making it a good candidate for parallelism.
=== Assignment 2 ===
=== Assignment 3 ===

Navigation menu