diff --git a/examples_ptx/radixSort/Makefile_cpu b/examples_ptx/radixSort/Makefile_cpu
index a70ba750..70817d09 100644
--- a/examples_ptx/radixSort/Makefile_cpu
+++ b/examples_ptx/radixSort/Makefile_cpu
@@ -1,7 +1,7 @@
 
-EXAMPLE=sort
-CPP_SRC=sort.cpp sort_serial.cpp
-ISPC_SRC=sort.ispc
+EXAMPLE=radixSort
+CPP_SRC=radixSort.cpp 
+ISPC_SRC=radixSort.ispc
 ISPC_IA_TARGETS=avx1-i32x8
 ISPC_ARM_TARGETS=neon
 #ISPC_FLAGS=-DDEBUG
diff --git a/examples_ptx/radixSort/radixSort.cpp b/examples_ptx/radixSort/radixSort.cpp
new file mode 100644
index 00000000..0be0f562
--- /dev/null
+++ b/examples_ptx/radixSort/radixSort.cpp
@@ -0,0 +1,102 @@
+#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;
+}
+
+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;
+  unsigned int *keys = new unsigned int [n];
+  unsigned int *tmpv  = new unsigned int [n];
+  unsigned int *keys_orig = new unsigned int [n];
+  
+  srand48(rtc()*65536);
+
+#pragma omp parallel for
+  for (int i = 0; i < n; i++)
+  {
+    keys[i] = drand48() * (1<<30);
+    tmpv[i] = 0;
+  }
+  std::random_shuffle(keys, keys + n);
+
+#pragma omp parallel for
+  for (int i = 0; i < n; i++)
+    keys_orig[i] = keys[i];
+    
+  ispcSetMallocHeapLimit(1024*1024*1024);
+
+  for (i = 0; i < m; i ++)
+  {
+    ispcMemcpy(keys, keys_orig, n*sizeof(unsigned int));
+    reset_and_start_timer();
+    ispc::radixSort(n, (int*)keys, (int*)tmpv);
+    tISPC2 += get_elapsed_msec();
+    if (argc != 3)
+        progressbar (i, m);
+  }
+
+  printf("[sort ispc + tasks]:\t[%.3f] msec [%.3f Mpair/s]\n", tISPC2, 1.0e-3*n*m/tISPC2);
+
+  std::sort(keys_orig, keys_orig + n);
+  for (int i = 0; i < n; i++)
+    assert(keys[i] == keys_orig[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;
+  delete tmpv;
+  return 0;
+}