summaryrefslogtreecommitdiff
path: root/VA/baselines/cpu/app_baseline.c
diff options
context:
space:
mode:
authorBirte Kristina Friesel <birte.friesel@uos.de>2024-07-04 12:01:50 +0200
committerBirte Kristina Friesel <birte.friesel@uos.de>2024-07-04 12:01:50 +0200
commit924591b798bd6ded48d993e4ff8dd122941369a4 (patch)
tree4d1da43a9423f282f99f8f8ace39df4eb06794e5 /VA/baselines/cpu/app_baseline.c
parente6226cae7e4adeaade80fad37ead2360aaa042dc (diff)
VA: Add NUMA baseline variant
Diffstat (limited to 'VA/baselines/cpu/app_baseline.c')
-rw-r--r--VA/baselines/cpu/app_baseline.c137
1 files changed, 114 insertions, 23 deletions
diff --git a/VA/baselines/cpu/app_baseline.c b/VA/baselines/cpu/app_baseline.c
index 8d95479..458cf41 100644
--- a/VA/baselines/cpu/app_baseline.c
+++ b/VA/baselines/cpu/app_baseline.c
@@ -15,6 +15,18 @@
#include <omp.h>
#include "../../support/timer.h"
+#if NUMA
+#include <numaif.h>
+#include <numa.h>
+
+void* mp_pages[1];
+int mp_status[1];
+int mp_nodes[1];
+int numa_node_in = -1;
+int numa_node_out = -1;
+int numa_node_cpu = -1;
+#endif
+
#define XSTR(x) STR(x)
#define STR(x) #x
@@ -25,25 +37,6 @@
static T *A;
static T *B;
static T *C;
-static T *C2;
-
-/**
-* @brief creates a "test file" by filling a buffer of 64MB with pseudo-random values
-* @param nr_elements how many 32-bit elements we want the file to be
-* @return the buffer address
-*/
-void *create_test_file(unsigned int nr_elements) {
- srand(0);
- A = (T*) malloc(nr_elements * sizeof(T));
- B = (T*) malloc(nr_elements * sizeof(T));
- C = (T*) malloc(nr_elements * sizeof(T));
-
- for (int i = 0; i < nr_elements; i++) {
- A[i] = (T) (rand());
- B[i] = (T) (rand());
- }
-
-}
/**
* @brief compute output in the host
@@ -63,6 +56,11 @@ typedef struct Params {
int n_reps;
int exp;
int n_threads;
+#if NUMA
+ struct bitmask* bitmask_in;
+ struct bitmask* bitmask_out;
+ int numa_node_cpu;
+#endif
}Params;
void usage() {
@@ -88,9 +86,14 @@ struct Params input_params(int argc, char **argv) {
p.n_reps = 3;
p.exp = 0;
p.n_threads = 5;
+#if NUMA
+ p.bitmask_in = NULL;
+ p.bitmask_out = NULL;
+ p.numa_node_cpu = -1;
+#endif
int opt;
- while((opt = getopt(argc, argv, "hi:w:e:x:t:")) >= 0) {
+ while((opt = getopt(argc, argv, "hi:w:e:x:t:a:b:c:")) >= 0) {
switch(opt) {
case 'h':
usage();
@@ -101,6 +104,11 @@ struct Params input_params(int argc, char **argv) {
case 'e': p.n_reps = atoi(optarg); break;
case 'x': p.exp = atoi(optarg); break;
case 't': p.n_threads = atoi(optarg); break;
+#if NUMA
+ case 'a': p.bitmask_in = numa_parse_nodestring(optarg); break;
+ case 'b': p.bitmask_out = numa_parse_nodestring(optarg); break;
+ case 'c': p.numa_node_cpu = atoi(optarg); break;
+#endif
default:
fprintf(stderr, "\nUnrecognized option!\n");
usage();
@@ -122,7 +130,78 @@ int main(int argc, char **argv) {
const unsigned int input_size = p.exp == 0 ? p.input_size * p.n_threads : p.input_size;
// Create an input file with arbitrary data.
- create_test_file(input_size);
+ /**
+ * @brief creates a "test file" by filling a buffer of 64MB with pseudo-random values
+ * @param nr_elements how many 32-bit elements we want the file to be
+ * @return the buffer address
+ */
+ srand(0);
+
+#if NUMA
+ if (p.bitmask_in) {
+ numa_set_membind(p.bitmask_in);
+ numa_free_nodemask(p.bitmask_in);
+ }
+ A = (T*) numa_alloc(input_size * sizeof(T));
+ B = (T*) numa_alloc(input_size * sizeof(T));
+#else
+ A = (T*) malloc(input_size * sizeof(T));
+ B = (T*) malloc(input_size * sizeof(T));
+#endif
+
+#if NUMA
+ if (p.bitmask_out) {
+ numa_set_membind(p.bitmask_out);
+ numa_free_nodemask(p.bitmask_out);
+ }
+ C = (T*) numa_alloc(input_size * sizeof(T));
+#else
+ C = (T*) malloc(input_size * sizeof(T));
+#endif
+
+ for (unsigned int i = 0; i < input_size; i++) {
+ A[i] = (T) (rand());
+ B[i] = (T) (rand());
+ }
+
+#if NUMA
+ struct bitmask *bitmask_all = numa_allocate_nodemask();
+ numa_bitmask_setall(bitmask_all);
+ numa_set_membind(bitmask_all);
+ numa_free_nodemask(bitmask_all);
+#endif
+
+#if NUMA
+ mp_pages[0] = A;
+ if (move_pages(0, 1, mp_pages, NULL, mp_status, 0) == -1) {
+ perror("move_pages(A)");
+ }
+ else if (mp_status[0] < 0) {
+ printf("move_pages error: %d", mp_status[0]);
+ }
+ else {
+ numa_node_in = mp_status[0];
+ }
+
+ mp_pages[0] = C;
+ if (move_pages(0, 1, mp_pages, NULL, mp_status, 0) == -1) {
+ perror("move_pages(C)");
+ }
+ else if (mp_status[0] < 0) {
+ printf("move_pages error: %d", mp_status[0]);
+ }
+ else {
+ numa_node_out = mp_status[0];
+ }
+
+ numa_node_cpu = p.numa_node_cpu;
+ if (numa_node_cpu != -1) {
+ if (numa_run_on_node(numa_node_cpu) == -1) {
+ perror("numa_run_on_node");
+ numa_node_cpu = -1;
+ }
+ }
+#endif
Timer timer;
@@ -137,9 +216,15 @@ int main(int argc, char **argv) {
nr_threads++;
if (rep >= p.n_warmup) {
- printf("[::] VA CPU | n_threads=%d e_type=%s n_elements=%d "
- "| throughput_MBps=%f",
+ printf("[::] VA CPU | n_threads=%d e_type=%s n_elements=%d"
+#if NUMA
+ " numa_node_in=%d numa_node_out=%d numa_node_cpu=%d numa_distance_in_cpu=%d numa_distance_cpu_out=%d"
+#endif
+ " | throughput_MBps=%f",
nr_threads, XSTR(T), input_size,
+#if NUMA
+ numa_node_in, numa_node_out, numa_node_cpu, numa_distance(numa_node_in, numa_node_cpu), numa_distance(numa_node_cpu, numa_node_out),
+#endif
input_size * 3 * sizeof(T) / timer.time[0]);
printf(" throughput_MOpps=%f",
input_size / timer.time[0]);
@@ -147,9 +232,15 @@ int main(int argc, char **argv) {
}
}
+#if NUMA
+ numa_free(A, input_size * sizeof(T));
+ numa_free(B, input_size * sizeof(T));
+ numa_free(C, input_size * sizeof(T));
+#else
free(A);
free(B);
free(C);
+#endif
return 0;
}