Difference between revisions of "The Bean Counters"
| Line 1: | Line 1: | ||
{{GPU610/DPS915 Index | 20181}} | {{GPU610/DPS915 Index | 20181}} | ||
| − | = | + | = Info and whatnot = |
''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.'' | ''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.'' | ||
| Line 9: | Line 9: | ||
[mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All] | [mailto:ytian38@myseneca.ca,cansin@myseneca.ca?/subject=GPU610 Email All] | ||
| − | |||
== Projects == | == Projects == | ||
| Line 18: | Line 17: | ||
= Progress = | = Progress = | ||
| − | |||
== A1: Select and Assess == | == 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: | There wasn't a project source code for this. Everything was written by yours truly. etc. etc. etc. The 10 algorithms tested are: | ||
| Line 52: | Line 50: | ||
==== Clustered Column Chart ==== | ==== Clustered Column Chart ==== | ||
[[File:Desktop_Screenshot_2018.04.02_-_17.14.57.19_-_Copy_(2).png]] | [[File:Desktop_Screenshot_2018.04.02_-_17.14.57.19_-_Copy_(2).png]] | ||
| + | |||
| + | |||
| + | |||
== A2: Parallelize == | == A2: Parallelize == | ||
| − | |||
=== Source Code === | === Source Code === | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
| − | |||
===== selection sort ===== | ===== selection sort ===== | ||
===== insertion sort ===== | ===== insertion sort ===== | ||
| − | + | ---- | |
=== Results === | === Results === | ||
==== Visual Profiler ==== | ==== Visual Profiler ==== | ||
==== Parallel NSight ==== | ==== Parallel NSight ==== | ||
==== Comparison ==== | ==== Comparison ==== | ||
| + | |||
| + | |||
== A3: Optimize == | == A3: Optimize == | ||
| − | |||
=== Source Code === | === Source Code === | ||
===== bubble sort ===== | ===== bubble sort ===== | ||
===== selection sort ===== | ===== selection sort ===== | ||
===== insertion sort ===== | ===== insertion sort ===== | ||
| − | + | ---- | |
=== Results === | === Results === | ||
==== Visual Profiler ==== | ==== Visual Profiler ==== | ||
==== Parallel NSight ==== | ==== Parallel NSight ==== | ||
==== Comparison ==== | ==== Comparison ==== | ||
Revision as of 09:41, 5 April 2018
GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary
Contents
Info and whatnot
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
Email All
Projects
- sudoku - by Tian Debebe (CMU) not affiliated with Yankai whatsoever
- sorting algorithms - Alex Allain cprogramming.com, 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
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)
