137 lines
3.7 KiB
C++
137 lines
3.7 KiB
C++
/*
|
|
Copyright (c) 2013, Durham University
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
|
|
* Neither the name of Durham University nor the names of its
|
|
contributors may be used to endorse or promote products derived from
|
|
this software without specific prior written permission.
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
|
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
|
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/* Author: Tomasz Koziara */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <algorithm>
|
|
#include <iostream>
|
|
#include <iomanip>
|
|
#include "../timing.h"
|
|
#include "sort_ispc.h"
|
|
|
|
using namespace ispc;
|
|
|
|
extern void sort_serial (int n, unsigned int code[], int order[]);
|
|
|
|
/* 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 *code = new unsigned int [n];
|
|
int *order = new int [n];
|
|
|
|
srand (0);
|
|
|
|
for (i = 0; i < m; i ++)
|
|
{
|
|
for (j = 0; j < n; j ++) code [j] = random() % l;
|
|
|
|
reset_and_start_timer();
|
|
|
|
sort_ispc (n, code, order, 1);
|
|
|
|
tISPC1 += get_elapsed_mcycles();
|
|
|
|
if (argc != 3)
|
|
progressbar (i, m);
|
|
}
|
|
|
|
printf("[sort ispc]:\t[%.3f] million cycles\n", tISPC1);
|
|
|
|
srand (0);
|
|
|
|
for (i = 0; i < m; i ++)
|
|
{
|
|
for (j = 0; j < n; j ++) code [j] = random() % l;
|
|
|
|
reset_and_start_timer();
|
|
|
|
sort_ispc (n, code, order, 0);
|
|
|
|
tISPC2 += get_elapsed_mcycles();
|
|
|
|
if (argc != 3)
|
|
progressbar (i, m);
|
|
}
|
|
|
|
printf("[sort ispc + tasks]:\t[%.3f] million cycles\n", tISPC2);
|
|
|
|
srand (0);
|
|
|
|
for (i = 0; i < m; i ++)
|
|
{
|
|
for (j = 0; j < n; j ++) code [j] = random() % l;
|
|
|
|
reset_and_start_timer();
|
|
|
|
sort_serial (n, code, order);
|
|
|
|
tSerial += get_elapsed_mcycles();
|
|
|
|
if (argc != 3)
|
|
progressbar (i, m);
|
|
}
|
|
|
|
printf("[sort serial]:\t\t[%.3f] million cycles\n", tSerial);
|
|
|
|
printf("\t\t\t\t(%.2fx speedup from ISPC, %.2fx speedup from ISPC + tasks)\n", tSerial/tISPC1, tSerial/tISPC2);
|
|
|
|
delete code;
|
|
delete order;
|
|
return 0;
|
|
}
|