Changes

N/A

109 bytes added, 15:16, 23 March 2019

→‎Assignment 2

As for merge, I had difficulty doing recursion on the kernel but was solved using “-arch=sm_35 -rdc=true” command line switch. Merge can be optimized and improved greatly unlike the odd-even bubble sort since I found out there to be multiple solutions to creating it. I also happened to find a merge sort implementation in CUDA 6.0 Samples which were quite complex to understand but overall much faster than my implementation.

~~BUBBLE LINKMERGE LINK~~[[File:a2_bubble.cu.txt]]

[[File:A2_merge.cu.txt]]

'''Woosle Park – Insertion Sort & Heap Sort'''

~~INSERTION LINKHEAP LINK~~[[File:A2_insertion.cu.txt]][[File:A2_heap.cu.txt]]

'''Jordan Pitters – Selection & Quick Sort'''

~~Quick LINK~~[[File:A2_quick.cu.txt]]~~Selection LINK~~[[File:A2_selection.cu.txt]]

----

'''Final thoughts'''

[[File:A2_comparison.xlxs]]

Our parallel sorting algorithms were slower on the GPU. However, after reprofiling on an average computer with the following specs:

Akshat

45

edits

CDOT Wiki β

Changes

N/A

CDOT Wiki ^β