212
edits
Changes
→OPTIMIZATION
With this optimized code it is now possible to execute with a problem size > 2000 & 2000.
== FIRST OPTIMIZATION & Execution Comparison Times==
If you have not, please take a look at section 3.1.1.1(just above), as it shows how the first iteration of optimization has been delivered.
Below is a comparison of times from the original CPU to the newly optimized kernel execution.
TIMES ARE IN MILLISECONDS
N Linux Visual No Parallel Parallized Optimized_A
(2000 ^ 2) 1160 | 20520 | 6749 | 971
(5000 ^ 2) 28787 | 127373 | n/a | 1417
(10000 ^ 2) 124179 | 522576 | n/a | 3054
