116 lines
2.5 KiB
C++
116 lines
2.5 KiB
C++
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
#include <cassert>
|
|
#include <iomanip>
|
|
#include "../timing.h"
|
|
#include "../ispc_malloc.h"
|
|
#include "radixSort_ispc.h"
|
|
|
|
/* progress bar by Ross Hemsley;
|
|
* http://www.rosshemsley.co.uk/2011/02/creating-a-progress-bar-in-c-or-any-other-console-app/ */
|
|
static inline void progressbar (unsigned int x, unsigned int n, unsigned int w = 50)
|
|
{
|
|
if (n < 100)
|
|
{
|
|
x *= 100/n;
|
|
n = 100;
|
|
}
|
|
|
|
if ((x != n) && (x % (n/100) != 0)) return;
|
|
|
|
using namespace std;
|
|
float ratio = x/(float)n;
|
|
int c = ratio * w;
|
|
|
|
cout << setw(3) << (int)(ratio*100) << "% [";
|
|
for (int x=0; x<c; x++) cout << "=";
|
|
for (int x=c; x<w; x++) cout << " ";
|
|
cout << "]\r" << flush;
|
|
}
|
|
|
|
struct Key
|
|
{
|
|
int32_t key,val;
|
|
};
|
|
|
|
int main (int argc, char *argv[])
|
|
{
|
|
int i, j, n = argc == 1 ? 1000000 : atoi(argv[1]), m = n < 100 ? 1 : 50, l = n < 100 ? n : RAND_MAX;
|
|
double tISPC1 = 0.0, tISPC2 = 0.0, tSerial = 0.0;
|
|
Key *keys = new Key [n];
|
|
Key *keys_orig = new Key [n];
|
|
unsigned int *keys_gold = new unsigned int [n];
|
|
|
|
srand48(rtc()*65536);
|
|
|
|
#pragma omp parallel for
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
keys[i].key = drand48() * (1<<30);
|
|
// keys[i].val = i;
|
|
}
|
|
|
|
std::random_shuffle(keys, keys + n);
|
|
|
|
#pragma omp parallel for
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
keys_gold[i] = keys[i].key;
|
|
keys_orig[i] = keys[i];
|
|
}
|
|
|
|
ispcSetMallocHeapLimit(1024*1024*1024);
|
|
|
|
ispc::radixSort_alloc(n);
|
|
|
|
for (i = 0; i < m; i ++)
|
|
{
|
|
ispcMemcpy(keys, keys_orig, n*sizeof(Key));
|
|
reset_and_start_timer();
|
|
ispc::radixSort(n, (int64_t*)keys);
|
|
tISPC2 += get_elapsed_msec();
|
|
if (argc != 3)
|
|
progressbar (i, m);
|
|
}
|
|
|
|
ispc::radixSort_free();
|
|
|
|
printf("[sort ispc + tasks]:\t[%.3f] msec [%.3f Mpair/s]\n", tISPC2, 1.0e-3*n*m/tISPC2);
|
|
|
|
std::sort(keys_gold, keys_gold + n);
|
|
for (int i = 0; i < n; i++)
|
|
assert(keys[i].key == keys_gold[i]);
|
|
|
|
|
|
#if 0
|
|
for (i = 0; i < m; i ++)
|
|
{
|
|
ispcMemcpy(code, code_orig, n*sizeof(unsigned int));
|
|
|
|
reset_and_start_timer();
|
|
|
|
sort_serial (n, code, order);
|
|
|
|
tSerial += get_elapsed_msec();
|
|
|
|
if (argc != 3)
|
|
progressbar (i, m);
|
|
}
|
|
|
|
printf("[sort serial]:\t\t[%.3f] msec [%.3f Mpair/s]\n", tSerial, 1.0e-3*n*m/tSerial);
|
|
|
|
#ifndef _CUDA_
|
|
printf("\t\t\t\t(%.2fx speedup from ISPC, %.2fx speedup from ISPC + tasks)\n", tSerial/tISPC1, tSerial/tISPC2);
|
|
#else
|
|
printf("\t\t\t\t(%.2fx speedup from ISPC + tasks)\n", tSerial/tISPC2);
|
|
#endif
|
|
#endif
|
|
|
|
delete keys;
|
|
delete keys_orig;
|
|
delete keys_gold;
|
|
return 0;
|
|
}
|