45
edits
Changes
N/A
,→Assignment 1
'''N = 50,000'''
Total Time (seconds) = 7.98 seconds
Flat profile:
'''N = 100,000'''
Total Time (seconds) = 31.42 seconds
Flat profile:
'''N = 500,000'''
Total Time (minutes) = 13.47 minutes
Flat profile:
'''Final Selection: Sorting Algorithms'''
Based on the profiled applications above, we think that the sorting algorithms would benefit a lot from offloading to the GPU. Sorting Algorithms are commonly used in programming. The sorting algorithm used and can have a strong impact on the programs speed and efficiency. Since they are so widely commonly used, we think it would be quite interesting to see if we can speed up the O(n^2) sorting algorithms to potentially match the sorting speed of the O(n log n) algorithms since there won’t much change for the parallelized version of them , as they are already fast.
=== Assignment 2 ===
=== Assignment 3 ===
