kmc7468/cs420
1
0
Fork 0
mirror of https://github.com/kmc7468/cs420.git synced 2025-12-14 22:38:46 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update benchmarks

Browse Source
This commit is contained in:
Minseong Jang
2025-06-13 15:19:21 +09:00
parent 49410f5264
commit 1aa18bce30
11 changed files with 201 additions and 193 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
bench/graph.c
View File

@@ -52,15 +52,17 @@ int graph_dijkstra(int n, int nonce) {
graph_dijkstra_visited[v] = 1;
for (int i = 0; i < n; ++i) {
if (graph_dijkstra_visited[i]) continue;
if (graph_dijkstra_dist[i] != -1 && graph_dijkstra_dist[i] < dist + graph_weight[v][i]) continue;
if (graph_dijkstra_visited[i])
continue;
if (graph_dijkstra_dist[i] != -1 && graph_dijkstra_dist[i] < dist + graph_weight[v][i])
continue;
graph_dijkstra_dist[i] = dist + graph_weight[v][i];
}
}
int result = 0;
for (int i = 0; i < n; ++i) {
result += graph_dijkstra_dist[i];
result ^= graph_dijkstra_dist[i];
}
return result;
@@ -76,12 +78,15 @@ int graph_floyd_warshall(int n, int nonce) {
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
if (graph_weight[i][k] == -1) continue;
if (graph_weight[i][k] == -1)
continue;
for (int j = 0; j < n; ++j) {
if (graph_weight[k][j] == -1) continue;
if (graph_weight[k][j] == -1)
continue;
int weight = graph_weight[i][k] + graph_weight[k][j];
if (graph_weight[i][j] != -1 && graph_weight[i][j] < weight) continue;
if (graph_weight[i][j] != -1 && graph_weight[i][j] < weight)
continue;
graph_weight[i][j] = weight;
}
}
@@ -90,7 +95,7 @@ int graph_floyd_warshall(int n, int nonce) {
int result = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
result += graph_weight[i][j];
result ^= graph_weight[i][j];
}
}
return result;

4
bench/matrix.c
View File

@@ -30,7 +30,7 @@ int matrix_mul(int n, int nonce) {
for (int k = 0; k < n; ++k) {
matrix_c[i][j] += matrix_a[i][k] * matrix_b[k][j];
}
result += matrix_c[i][j];
result ^= matrix_c[i][j];
}
}
@@ -50,7 +50,7 @@ int matrix_add(int n, int nonce) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
matrix_c[i][j] = matrix_a[i][j] + nonce * matrix_b[i][j];
result += matrix_c[i][j];
result ^= matrix_c[i][j];
}
}

2
bench/median.c
View File

@@ -56,7 +56,7 @@ int verify_median(int n, int* test) {
for (i = 0; i < n; i++) {
int v = test[i];
result += v;
result ^= v;
}
return result;

5
bench/multiply.c
View File

@@ -26,6 +26,9 @@ int multiply(int x, int y) {
int result = 0;
for (i = 0; i < 32; i++) {
if (x == 0)
break;
if ((x & 0x1) == 1)
result = result + y;
@@ -47,7 +50,7 @@ int verify_multiply(int n, int* test) {
if (t0 * t1 != v)
return 1;
result += v;
result ^= v;
}
return result;

2
bench/qsort.c
View File

@@ -115,7 +115,7 @@ int verify_qsort(int n, int* test) {
if (t0 > t1)
return 1;
result += t0;
result ^= t0;
}
return result;

2
bench/rsort.c
View File

@@ -101,7 +101,7 @@ int verify_rsort(int n, int* test) {
if (t0 > t1)
return 1;
result += t0;
result ^= t0;
}
return result;

2
bench/spmv.c
View File

@@ -74,7 +74,7 @@ int verifyDouble(int n, double* test) {
int result = 0;
for (i = 0; i < n; i++) {
result += (int) (test[i]);
result ^= (int) (test[i]);
}
return result;

2
bench/two_dimension_array.c
View File

@@ -11,7 +11,7 @@ int two_dimension_array(int n, int nonce) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
two_dimension_array_arr[i] += two_dimension_array_arr[j];
two_dimension_array_arr[i] ^= two_dimension_array_arr[j];
}
}

2
bench/vvadd.c
View File

@@ -35,7 +35,7 @@ int verify_vvadd(int n, int* test) {
for (i = 0; i < n; i++) {
int v = test[i];
result += v;
result ^= v;
}
return result;