1
edit
Changes
→Assignment 2 and 3
[[File:ChartMonteCarlo.JPG]]
'''Issues'''
The main issue for me was to figure out how to use the kernel for this approach. At first I tried to pass a value of either 1 or 0 for whether or not the dot landed within the circle within each thread, and pass it out into an array individually. Later on Chris gave me the idea of getting a partial sum for all the threads within each block and pass that out instead, which is a way better approach.
For optimization, I tried using reduction, however it didn't seem to speed up the program.