1
edit
Changes
→Assignment 1
{{GPU610/DPS915 Index | 2013120143}}= Project Name Goes here DARTBOARD PI CALCULATOR =
== Team Members ==
# [mailto:wchamilton@myseneca.ca?subject=dps915 Wesley Hamilton], Team leader
# [mailto:ncuriciac@myseneca.ca?subject=dps915 Norbert Curiciac], Team member
# [mailto:rlanderson@myseneca.ca@myseneca.ca?subject=dps915 Rene Leon Anderson], Team member
== Progress ==
=== Assignment 1 ===
'''Norbert''':Calculation of PI''' '''Problem Description'''
For this assignment, I selected one application that I wished to parallelize. I profiled it to find the hotspot of the application and determine if it was feasible to speed up using the GPU.
My application that I selected is a PI approximation methodfunction. PI can be approximated in a number of ways however I chose to use the dartboard algorithm. Although not the fastest, the algorithm is very feasible to parallelize. The main idea behind it can be compared to a dartboard – you throw a random number (n) of darts at the board and note down the darts that have landed within it and those that have not. The image below demonstrates this concept:
[[File:Exampledart.jpggif]]
The ratio of the randomly thrown dart is: (hits within dartboard) vs. (hits within square) is equal to the ratio between the two areas i.e. PI/4. The more darts we throw, the better we can approximate PI.
I created a screenshot from the first execution, the rest of the execution is summarized on the table and the chart below.
[[File:table.jpg]]
[[File:Pichart.jpg]]
https://computing.llnl.gov/tutorials/parallel_comp/#ExamplesPI