unimore/hpc-2022-g3
unimore/hpc-2022-g3
1
Fork 0
mirror of https://github.com/Steffo99/unimore-hpc-assignments.git synced 2024-11-26 01:54:22 +00:00
Code Activity

Run format document to indent code using tabs

Browse source
This commit is contained in:
Steffo 2022-11-28 15:26:10 +01:00
parent f0394d1b3b
commit f4a903371a
Signed by: steffo
GPG key ID: 6965406171929D01
1 changed files with 72 additions and 81 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

153
OpenMP/linear-algebra/kernels/atax/atax.cu
View file

@ -14,111 +14,102 @@
// It is exclusive to the GNU C compiler // It is exclusive to the GNU C compiler
// https://www.gnu.org/software/libc/manual/html_node/Mathematical-Constants.html // https://www.gnu.org/software/libc/manual/html_node/Mathematical-Constants.html
#ifndef M_PI #ifndef M_PI
#define M_PI 3.141 #define M_PI 3.141
#endif #endif
/* Array initialization. */ /* Array initialization. */
static void init_array(int nx, int ny, static void init_array(int nx, int ny, DATA_TYPE POLYBENCH_2D(A, NX, NY, nx, ny), DATA_TYPE POLYBENCH_1D(x, NY, ny))
DATA_TYPE POLYBENCH_2D(A, NX, NY, nx, ny),
DATA_TYPE POLYBENCH_1D(x, NY, ny))
{ {
int i, j; int i, j;
/// Initialize the `x` array with PI and its multiples. /// Initialize the `x` array with PI and its multiples.
for (i = 0; i < ny; i++) { for (i = 0; i < ny; i++) {
x[i] = i * M_PI; x[i] = i * M_PI;
} }
/// Initialize the `A` matrix /// Initialize the `A` matrix
for (i = 0; i < nx; i++) { for (i = 0; i < nx; i++) {
for (j = 0; j < ny; j++) { for (j = 0; j < ny; j++) {
A[i][j] = ((DATA_TYPE)i * (j + 1)) / nx; A[i][j] = ((DATA_TYPE)i * (j + 1)) / nx;
} }
} }
} }
/* DCE code. Must scan the entire live-out data. /* DCE code. Must scan the entire live-out data.
Can be used also to check the correctness of the output. */ Can be used also to check the correctness of the output. */
static void print_array(int nx, static void print_array(int nx, DATA_TYPE POLYBENCH_1D(y, NX, nx))
DATA_TYPE POLYBENCH_1D(y, NX, nx))
{ {
int i; int i;
/// Print all numbers in the array sequentially. /// Print all numbers in the array sequentially.
// Cannot parallelize this: prints have to be sequential to make sense! // Cannot parallelize this: prints have to be sequential to make sense!
for (i = 0; i < nx; i++) { for (i = 0; i < nx; i++) {
fprintf(stderr, DATA_PRINTF_MODIFIER, y[i]); fprintf(stderr, DATA_PRINTF_MODIFIER, y[i]);
} }
fprintf(stderr, "\n"); fprintf(stderr, "\n");
} }
/* Main computational kernel. The whole function will be timed, /* Main computational kernel. The whole function will be timed,
including the call and return. */ including the call and return. */
static void kernel_atax(int nx, int ny, static void kernel_atax(int nx, int ny, DATA_TYPE POLYBENCH_2D(A, NX, NY, nx, ny), DATA_TYPE POLYBENCH_1D(x, NY, ny), DATA_TYPE POLYBENCH_1D(y, NY, ny))
DATA_TYPE POLYBENCH_2D(A, NX, NY, nx, ny),
DATA_TYPE POLYBENCH_1D(x, NY, ny),
DATA_TYPE POLYBENCH_1D(y, NY, ny))
{ {
int i, j; int i, j;
for (i = 0; i < _PB_NY; i++) for (i = 0; i < _PB_NY; i++)
y[i] = 0; y[i] = 0;
/// This computes... something? I guess whatever ATAX is? /// This computes... something? I guess whatever ATAX is?
// Now this gives a nice speedup, especially with a lot more threads than the count! // Now this gives a nice speedup, especially with a lot more threads than the count!
// THREAD_COUNT * 4 seems to be the best on my local computer. What's the best for the Jetson Nano? // THREAD_COUNT * 4 seems to be the best on my local computer. What's the best for the Jetson Nano?
for (i = 0; i < _PB_NX; i++) for (i = 0; i < _PB_NX; i++)
{ {
/// Every iteration has its own tmp variable /// Every iteration has its own tmp variable
DATA_TYPE tmp = 0; DATA_TYPE tmp = 0;
for (j = 0; j < _PB_NY; j++) { for (j = 0; j < _PB_NY; j++) {
/// Which gets increased by a bit on every iteration /// Which gets increased by a bit on every iteration
tmp += A[i][j] * x[j]; tmp += A[i][j] * x[j];
} }
for (j = 0; j < _PB_NY; j++) { for (j = 0; j < _PB_NY; j++) {
/// Which is later used for to compute ATAX /// Which is later used for to compute ATAX
y[j] = y[j] + A[i][j] * tmp; y[j] = y[j] + A[i][j] * tmp;
} }
} }
} }
int main(int argc, char **argv) int main(int argc, char **argv)
{ {
/* Retrieve problem size. */ /* Retrieve problem size. */
int nx = NX; int nx = NX;
int ny = NY; int ny = NY;
/* Variable declaration/allocation. */ /* Variable declaration/allocation. */
POLYBENCH_2D_ARRAY_DECL(A, DATA_TYPE, NX, NY, nx, ny); POLYBENCH_2D_ARRAY_DECL(A, DATA_TYPE, NX, NY, nx, ny);
POLYBENCH_1D_ARRAY_DECL(x, DATA_TYPE, NY, ny); POLYBENCH_1D_ARRAY_DECL(x, DATA_TYPE, NY, ny);
POLYBENCH_1D_ARRAY_DECL(y, DATA_TYPE, NY, ny); POLYBENCH_1D_ARRAY_DECL(y, DATA_TYPE, NY, ny);
/* Start timer. */ /* Start timer. */
polybench_start_instruments; polybench_start_instruments;
/* Initialize array(s). */ /* Initialize array(s). */
init_array(nx, ny, POLYBENCH_ARRAY(A), POLYBENCH_ARRAY(x)); init_array(nx, ny, POLYBENCH_ARRAY(A), POLYBENCH_ARRAY(x));
/* Run kernel. */ /* Run kernel. */
kernel_atax(nx, ny, kernel_atax(nx, ny, POLYBENCH_ARRAY(A), POLYBENCH_ARRAY(x), POLYBENCH_ARRAY(y));
POLYBENCH_ARRAY(A),
POLYBENCH_ARRAY(x),
POLYBENCH_ARRAY(y));
/* Stop and print timer. */ /* Stop and print timer. */
polybench_stop_instruments; polybench_stop_instruments;
polybench_print_instruments; polybench_print_instruments;
/* Prevent dead-code elimination. All live-out data must be printed /* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */ by the function call in argument. */
polybench_prevent_dce(print_array(nx, POLYBENCH_ARRAY(y))); polybench_prevent_dce(print_array(nx, POLYBENCH_ARRAY(y)));
/* Be clean. */ /* Be clean. */
POLYBENCH_FREE_ARRAY(A); POLYBENCH_FREE_ARRAY(A);
POLYBENCH_FREE_ARRAY(x); POLYBENCH_FREE_ARRAY(x);
POLYBENCH_FREE_ARRAY(y); POLYBENCH_FREE_ARRAY(y);
return 0; return 0;
} }