Commit | Date | |
---|---|---|
2012-11-13 21:41:41 | Tree | |
[r76]
by
guidrymw
Added reducedMaxFinder.cu and reducedMinFinder.cu, which illustrate tree algorithms to find max and min of array of number in ln N time. |
2012-11-13 21:32:01 | Tree |
[r75]
by
guidrymw
Added reducedSum.cu, which illustrates using a tree algorithm to sum an array of numbers in ln N time. |
2012-11-13 21:18:19 | Tree |
2012-11-13 20:55:22 | Tree | |
2012-11-13 19:57:34 | Tree | |
[r72]
by
guidrymw
This version of explicitgpu.cu appears to be giving the same results as the Java code for asymptotic up through a time of 2.2e-10 seconds (250 int steps), assuming in both codes dt = 0.1*t. |
2012-11-12 20:57:46 | Tree |
[r71]
by
guidrymw
This version of explicitgpu.cu appears to be giving the same results as the Java code for asymptotic up through a time of 1.9e-12 seconds, assuming in both codes dt = 0.1*t. |
2012-11-12 20:39:03 | Tree |
2012-11-12 18:45:36 | Tree | |
2012-11-07 13:18:00 | Tree | |
2012-11-07 13:17:10 | Tree |