Open main menu

CDOT Wiki β

Lucky Charms

Revision as of 21:06, 10 April 2018 by Victoriouswaffles (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Progress

Link to the presentation

A1: Select and Assess

There wasn't a project source code for this. Everything was written by yours truly, (with help from online sources for the algorithms). The 10 algorithms tested are:

Source Code

sort.h algorithms file, main.cpp (v1) file, main.cpp (v2) file, utilities.h file

bubble sort

 

selection sort

 

insertion sort

   

merge sort

 

heap sort

 

quick sort

 

counting sort

 

radix sort

 

bucket sort

 

shell sort

 


Results

Flat Profile

 

Call Graph

 

Clustered Column Chart

 



A2: Parallelize

Source Code

a2.cu file

bubble sort

  =>  

selection sort

  =>  

insertion sort

Can't be parallelized.


Results

Visual Profiler

Parallel NSight

Comparison

A3: Optimize

Source Code

a3.cu file

bubble sort

  =>  

selection sort

  =>  


Results

Visual Profiler

Parallel NSight

Comparison