Difference between revisions of "Lucky Charms"
(→A2: Parallelize) |
|||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 13: | Line 13: | ||
= Progress = | = Progress = | ||
| + | Link to the [https://docs.google.com/presentation/d/1P1Uuswg9xnzCXERpGGyWBigNgoNTSOwjSJP4NPFp_EM/edit?usp=sharing presentation] | ||
== A1: Select and Assess == | == A1: Select and Assess == | ||
| − | There wasn't a project source code for this. Everything was written by yours truly | + | 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 === | === Source Code === | ||
| + | [https://www.dropbox.com/s/gzq4hxxuo6w5v46/arraySorting.h?dl=0 sort.h] algorithms file, | ||
| + | [https://www.dropbox.com/s/ifckl4or27yn6qb/main.cpp?dl=0 main.cpp] (v1) file, | ||
| + | [https://www.dropbox.com/s/d9ki7psnuwy8pgd/main.cpp?dl=0 main.cpp] (v2) file, | ||
| + | [https://www.dropbox.com/s/28h29njwuw6rpw1/utilities.h?dl=0 utilities.h] file | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
[[File:BubbleS.png]] | [[File:BubbleS.png]] | ||
| Line 38: | Line 43: | ||
===== shell sort ===== | ===== shell sort ===== | ||
[[File:ShellS.png]] | [[File:ShellS.png]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
---- | ---- | ||
=== Results === | === Results === | ||
| Line 57: | Line 57: | ||
== A2: Parallelize == | == A2: Parallelize == | ||
=== Source Code === | === Source Code === | ||
| + | [https://www. a2.cu] file | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
| − | [[File:A2-bubblesort.png]] | + | [[File:BubbleS.png]] => [[File:A2-bubblesort.png]] |
===== selection sort ===== | ===== selection sort ===== | ||
| − | [[File:A2-selectionsort.png]] | + | [[File:SelectionS.png]] => [[File:A2-selectionsort.png]] |
===== insertion sort ===== | ===== insertion sort ===== | ||
| − | + | Can't be parallelized. | |
---- | ---- | ||
| Line 72: | Line 73: | ||
== A3: Optimize == | == A3: Optimize == | ||
=== Source Code === | === Source Code === | ||
| + | [https://www. a3.cu] file | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
| − | [[File:A3-bubblesort2.png]] | + | [[File:A2-bubblesort.png]] => [[File:A3-bubblesort2.png]] |
===== selection sort ===== | ===== selection sort ===== | ||
| − | [[File:A3-selectionsort.png]] | + | [[File:A2-selectionsort.png]] => [[File:A3-selectionsort.png]] |
| − | |||
---- | ---- | ||
=== Results === | === Results === | ||
Latest revision as of 21:06, 10 April 2018
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
Team Members
Email All
Projects
- sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
- sorting algorithms - Alex Allain cprogramming.com, Animations
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
.png)
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
=> 
