mirror of
https://github.com/Steffo99/unimore-hpc-assignments.git
synced 2024-11-26 01:54:22 +00:00
131 lines
2.5 KiB
Text
131 lines
2.5 KiB
Text
#include <stdio.h>
|
|
#include <unistd.h>
|
|
#include <string.h>
|
|
#include <math.h>
|
|
|
|
/* Include polybench common header. */
|
|
#include "polybench.hu"
|
|
|
|
/* Include benchmark-specific header. */
|
|
/* Default data type is double, default size is 4000. */
|
|
#include "atax.hu"
|
|
|
|
// Workaround for the editor not finding M_PI
|
|
// It is exclusive to the GNU C compiler
|
|
// https://www.gnu.org/software/libc/manual/html_node/Mathematical-Constants.html
|
|
#ifndef M_PI
|
|
#define M_PI 3.141
|
|
#endif
|
|
|
|
/**
|
|
* Initialize the arrays to be used in the computation:
|
|
*
|
|
* - `x` is filled with multiples of `M_PI`;
|
|
* - `A` is filled with sample data.
|
|
*
|
|
* To be called on the CPU (uses the `__host__` qualifier).
|
|
*/
|
|
__host__ static void init_array(DATA_TYPE** A, DATA_TYPE* x)
|
|
{
|
|
for (int i = 0; i < NY; i++)
|
|
{
|
|
x[i] = i * M_PI;
|
|
}
|
|
|
|
for (int i = 0; i < NX; i++)
|
|
{
|
|
for (int j = 0; j < NY; j++)
|
|
{
|
|
A[i][j] = ((DATA_TYPE)i * (j + 1)) / NX;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* Print the given array.
|
|
*
|
|
* Cannot be parallelized, as the elements of the array should be
|
|
*
|
|
* To be called on the CPU (uses the `__host__` qualifier).
|
|
*/
|
|
__host__ static void print_array(DATA_TYPE* y)
|
|
{
|
|
for (int i = 0; i < NX; i++)
|
|
{
|
|
fprintf(stderr, DATA_PRINTF_MODIFIER, y[i]);
|
|
}
|
|
fprintf(stderr, "\n");
|
|
}
|
|
|
|
|
|
/**
|
|
* Compute ATAX.
|
|
*
|
|
* Parallelizing this is the goal of the assignment.
|
|
*
|
|
* Currently to be called on the CPU (uses the `__host__` qualifier), but we may probably want to change that soon.
|
|
*/
|
|
__host__ static void kernel_atax(DATA_TYPE** A, DATA_TYPE* x, DATA_TYPE* y)
|
|
{
|
|
for (int i = 0; i < NY; i++)
|
|
{
|
|
y[i] = 0;
|
|
}
|
|
|
|
for (int i = 0; i < NX; i++)
|
|
{
|
|
DATA_TYPE tmp = 0;
|
|
|
|
for (int j = 0; j < NY; j++)
|
|
{
|
|
tmp += A[i][j] * x[j];
|
|
}
|
|
|
|
for (int j = 0; j < NY; j++)
|
|
{
|
|
y[j] = y[j] + A[i][j] * tmp;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
* The main function of the benchmark, which sets up tooling to measure the time spent computing `kernel_atax`.
|
|
*
|
|
* We should probably avoid editing this.
|
|
*/
|
|
__host__ int main(int argc, char **argv)
|
|
{
|
|
|
|
DATA_TYPE **A = new DATA_TYPE*[NX];
|
|
DATA_TYPE x[NY], y[NX];
|
|
|
|
for(size_t i=0; i<NX; i++)
|
|
{
|
|
A[i] = new DATA_TYPE[NY];
|
|
}
|
|
|
|
#ifdef POLYBENCH_INCLUDE_INIT
|
|
polybench_start_instruments;
|
|
#endif
|
|
|
|
|
|
init_array(A, x);
|
|
|
|
#ifndef POLYBENCH_INCLUDE_INIT
|
|
polybench_start_instruments;
|
|
#endif
|
|
|
|
kernel_atax(A, x, y);
|
|
|
|
polybench_stop_instruments;
|
|
polybench_print_instruments;
|
|
|
|
/* Prevent dead-code elimination. All live-out data must be printed by the function call in argument. */
|
|
polybench_prevent_dce(print_array(y));
|
|
|
|
return 0;
|
|
}
|