Open main menu

CDOT Wiki β

Changes

AAA Adrina Arsa Andriy

962 bytes added, 15:57, 31 October 2014
Assignment 2
The word can be anywhere from 1 letter, to 1000000 (The highest we have tested.)
With the parallelization, we noticed a massive almost no increase in speed when searching through long words. The Upon further experimentation, we realized that out memcopy's were what took up all the speed. When looking at the time taken for the search itself when going through 1000000 letters is the kernel, we noticed an almost instant when parallelized, where as it took several seconds before it was parallelized100% increase in speed.
The speed up times of the charts are below.
 
'''Size 100000:'''
<u>Parallel</u>
Guess a letter: a
Search Time: - took - 0.002000 secs
 
You found 3786 letters! Isn't that exciting!
You have 5 guesses left.
 
 
<u>Regular</u>
Guess a letter: a
Search Time: - took - 0.002000 secs
 
You found a letter! Isn't that exciting!
You have 5 guesses left.
 
'''Size 500000:'''
<u>Parallel</u>
Guess a letter: a
Search Time: - took - 0.003000 secs
 
You found 19198 letters! Isn't that exciting!
You have 4 guesses left.
 
<u>Regular</u>
Guess a letter: a
Search Time: - took - 0.006000 secs
 
You found a letter! Isn't that exciting!
You have 5 guesses left.
 
'''Size 1000000:'''
<u>Parallel</u>
Guess a letter: a
Search Time: - took - 0.005000 secs
 
You found 38256 letters! Isn't that exciting!
You have 5 guesses left.
 
 
<u>Regular</u>
Guess a letter: a
Search Time: - took - 0.006000 secs
 
You found a letter! Isn't that exciting!
You have 5 guesses left.
=== Assignment 3 ===