|
|
| (3 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | {{GPU610/DPS915 Index | 20181}}
| |
| | | | |
| − | ''Beans are a cheap commodity, so to count them is a rather silly thing to do. A "bean counter" is one who nitpicks over small things in order to save costs.''
| |
| − |
| |
| − | == Team Members ==
| |
| − | # [mailto:ytian38@myseneca.ca?/subject=GPU610 Yankai Tian]
| |
| − | # [mailto:cansin@myseneca.ca?/subject=GPU610 Jay Ansin]
| |
| − | [mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All]
| |
| − |
| |
| − | == Projects ==
| |
| − | # sudoku - [http://www.andrew.cmu.edu/user/astian/ by Tian Debebe (CMU)] ''not affiliated with Yankai whatsoever''
| |
| − | # '''sorting algorithms''' - [http://www.cprogramming.com/tutorial/computersciencetheory/sortcomp.html Alex Allain cprogramming.com], [https://www.toptal.com/developers/sorting-algorithms Animations]
| |
| − |
| |
| − |
| |
| − |
| |
| − | = Progress =
| |
| − | == A1: Select and Assess ==
| |
| − | There wasn't a project source code for this. Everything was written by yours truly. etc. etc. etc. The 10 algorithms tested are:
| |
| − |
| |
| − | === Source Code ===
| |
| − | ===== bubble sort =====
| |
| − | [[File:BubbleS.png]]
| |
| − | ===== selection sort =====
| |
| − | [[File:SelectionS.png]]
| |
| − | ===== insertion sort =====
| |
| − | [[File:InsertionS1.png]]
| |
| − | [[File:InsertionS2.png]]
| |
| − | ===== merge sort =====
| |
| − | [[File:MergeS.png]]
| |
| − | ===== heap sort =====
| |
| − | [[File:HeapS.png]]
| |
| − | ===== quick sort =====
| |
| − | [[File:QuickS.png]]
| |
| − | ===== counting sort =====
| |
| − | [[File:CountingS.png]]
| |
| − | ===== radix sort =====
| |
| − | [[File:RadixS.png]]
| |
| − | ===== bucket sort =====
| |
| − | [[File:BucketS.png]]
| |
| − | ===== shell sort =====
| |
| − | [[File:ShellS.png]]
| |
| − | ===== files =====
| |
| − | [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
| |
| − | ----
| |
| − | === Results ===
| |
| − | ==== Flat Profile ====
| |
| − | [[File:TBC a1Flat1.png]]
| |
| − | ==== Call Graph ====
| |
| − | [[File:TBC a1Call1.png]]
| |
| − | ==== Clustered Column Chart ====
| |
| − | [[File:Desktop_Screenshot_2018.04.02_-_17.14.57.19_-_Copy_(2).png]]
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − | == A2: Parallelize ==
| |
| − | === Source Code ===
| |
| − | ===== bubble sort =====
| |
| − | [[File:Bubble-a3.png]]
| |
| − | ===== selection sort =====
| |
| − | [[File:Selection-a2.png]]
| |
| − | ===== insertion sort =====
| |
| − | Cant be parallelized.
| |
| − | ===== radix sort =====
| |
| − | ----
| |
| − |
| |
| − | === Results ===
| |
| − | ==== Visual Profiler ====
| |
| − | ==== Parallel NSight ====
| |
| − | ==== Comparison ====
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − | == A3: Optimize ==
| |
| − | === Source Code ===
| |
| − | ===== bubble sort =====
| |
| − | [[File:Bubble-a3.png]]
| |
| − | ===== selection sort =====
| |
| − | [[File:Selection-a3.png]]
| |
| − | ===== radix sort =====
| |
| − | ----
| |
| − | === Results ===
| |
| − | ==== Visual Profiler ====
| |
| − | ==== Parallel NSight ====
| |
| − | ==== Comparison ====
| |
