aaron/ispc
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

+1

Browse Source
This commit is contained in:
Evghenii
2014-01-28 20:07:34 +01:00
parent 29bb129c9b
commit df51b41a45
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
examples_ptx/radixSort/radixSort.cpp
View File

@@ -65,19 +65,20 @@ int main (int argc, char *argv[])
ispc::radixSort_alloc(n); ispc::radixSort_alloc(n);
tISPC2 = 1e30;
for (i = 0; i < m; i ++) for (i = 0; i < m; i ++)
{ {
ispcMemcpy(keys, keys_orig, n*sizeof(Key)); ispcMemcpy(keys, keys_orig, n*sizeof(Key));
reset_and_start_timer(); reset_and_start_timer();
ispc::radixSort(n, (int64_t*)keys); ispc::radixSort(n, (int64_t*)keys);
tISPC2 += get_elapsed_msec(); tISPC2 = std::min(tISPC2, get_elapsed_msec());
if (argc != 3) if (argc != 3)
progressbar (i, m); progressbar (i, m);
} }
ispc::radixSort_free(); ispc::radixSort_free();
printf("[sort ispc + tasks]:\t[%.3f] msec [%.3f Mpair/s]\n", tISPC2, 1.0e-3*n*m/tISPC2); printf("[sort ispc + tasks]:\t[%.3f] msec [%.3f Mpair/s]\n", tISPC2, 1.0e-3*n/tISPC2);
std::sort(keys_gold, keys_gold + n); std::sort(keys_gold, keys_gold + n);
for (int i = 0; i < n; i++) for (int i = 0; i < n; i++)