Changes

====Jesse's Profiling Findings====

I found an iterated approximation of an N-Body project on GitHub at: https://github.com/jrupac/N-body-Simulation. The simulation uses the brute force algorithm with a run-time of O(n^2). It uses SDL to draw squares which represent each body. I have removed all SDL so it only does the calculations. It also has collision detection with other bodies. It still collides with the window sides even though I have removed the window. I also included a high resolution timer by Song Ho Ahn. The timer class can be found at: http://www.cnblogs.com/JohnShao/archive/2011/10/14/2211085.html

'''Testing Environment:'''

*Raw computations, no graphical visualization

*Brute force algoritim for calculation the forces O(N^2)

I ran a series of N-Body simulations and sampled each run 512 times. The results are exactly as you would expect for an O(n^2) algorithm; a quadratic increase in time.

[[File:gpu610_jsantos13_samples.png|border]]

Using Visual Studio 10 profiler, it is clear that the update function is an expensive call path.

[[File:gpu610_jsantos13_code.png|border]]

You can see that the majority of the processing time is used on SQ(square) and MAX(which value is bigger) calculations. The point calculation can be done independently and therefore can be parallelized with CUDA. This program can be speed up even more if we utilize the Barnes-hut algorithm for calculating N-Bodies using quad trees and spatial partitions.

=== Assignment 2 ===

=== Assignment 3 ===