Skip to content

Fix lu test #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
shuds13 wants to merge 1 commit into
base: main
Choose a base branch
from
Draft

Fix lu test #9

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 31 additions & 8 deletions polybench-cuda/lu/lu.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,20 +11,43 @@
#include <string.h>
#include <math.h>

static
void init_array (int n,
double *A)
{
int i, j;

for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
A[i*n+j] = ((double) (i+1)*(j+1)) / n;
static
void init_array(int n, double *A) {
int i, j;

for (i = 0; i < n; i++) {
for (j = 0; j <= i; j++) {
A[i * n + j] = (double)(-j % n) / n + 1;
}
for (j = i + 1; j < n; j++) {
A[i * n + j] = 0;
}
A[i * n + i] = 1;
}

// Make A positive semi-definite.
double *B = (double *)malloc(n * n * sizeof(double));
for (int r = 0; r < n; r++) {
for (int s = 0; s < n; s++) {
B[r * n + s] = 0.0;
}
}
for (int t = 0; t < n; t++) {
for (int r = 0; r < n; r++) {
for (int s = 0; s < n; s++) {
B[r * n + s] += A[r * n + t] * A[s * n + t];
}
}
}
memcpy(A, B, n * n * sizeof(double));
free(B);
}





static
void print_array(int n,
double *A)
Expand Down
38 changes: 30 additions & 8 deletions polybench-cuda/lu/lu_omp.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,20 +11,42 @@
#include <string.h>
#include <math.h>

static
void init_array (int n,
double *A)
{
int i, j;
static
void init_array(int n, double *A) {
int i, j;

for (i = 0; i < n; i++) {
for (j = 0; j <= i; j++) {
A[i * n + j] = (double)(-j % n) / n + 1;
}
for (j = i + 1; j < n; j++) {
A[i * n + j] = 0;
}
A[i * n + i] = 1;
}

for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
A[i*n+j] = ((double) (i+1)*(j+1)) / n;
// Make A positive semi-definite.
double *B = (double *)malloc(n * n * sizeof(double));
for (int r = 0; r < n; r++) {
for (int s = 0; s < n; s++) {
B[r * n + s] = 0.0;
}
}
for (int t = 0; t < n; t++) {
for (int r = 0; r < n; r++) {
for (int s = 0; s < n; s++) {
B[r * n + s] += A[r * n + t] * A[s * n + t];
}
}
}
memcpy(A, B, n * n * sizeof(double));
free(B);
}





static
void print_array(int n,
double *A)
Expand Down