summaryrefslogtreecommitdiff
path: root/BS/baselines
diff options
context:
space:
mode:
Diffstat (limited to 'BS/baselines')
-rw-r--r--BS/baselines/cpu/bs_omp.c345
1 files changed, 172 insertions, 173 deletions
diff --git a/BS/baselines/cpu/bs_omp.c b/BS/baselines/cpu/bs_omp.c
index 871792d..2e4c300 100644
--- a/BS/baselines/cpu/bs_omp.c
+++ b/BS/baselines/cpu/bs_omp.c
@@ -19,275 +19,274 @@
#include <numaif.h>
#include <numa.h>
-void* mp_pages[1];
+void *mp_pages[1];
int mp_status[1];
int mp_nodes[1];
-struct bitmask* bitmask_in;
+struct bitmask *bitmask_in;
int numa_node_in = -1;
int numa_node_cpu = -1;
#endif
-
#if NUMA_MEMCPY
-struct bitmask* bitmask_cpu;
+struct bitmask *bitmask_cpu;
int numa_node_cpu_memcpy = -1;
int numa_node_local = -1;
int numa_node_in_is_local = 0;
#endif
-
#define DTYPE uint64_t
/*
* @brief creates a "test file" by filling a bufferwith values
*/
-void create_test_file(DTYPE * input, uint64_t nr_elements, DTYPE * querys, uint64_t n_querys) {
+void create_test_file(DTYPE *input, uint64_t nr_elements, DTYPE *querys,
+ uint64_t n_querys)
+{
- srand(time(NULL));
+ srand(time(NULL));
- input[0] = 1;
- for (uint64_t i = 1; i < nr_elements; i++) {
- input[i] = input[i - 1] + (rand() % 10) + 1;
- }
+ input[0] = 1;
+ for (uint64_t i = 1; i < nr_elements; i++) {
+ input[i] = input[i - 1] + (rand() % 10) + 1;
+ }
- for(uint64_t i = 0; i < n_querys; i++)
- {
- querys[i] = input[rand() % nr_elements];
- }
+ for (uint64_t i = 0; i < n_querys; i++) {
+ querys[i] = input[rand() % nr_elements];
+ }
}
/**
* @brief compute output in the host
*/
-uint64_t binarySearch(DTYPE * input, uint64_t input_size, DTYPE* querys, unsigned n_querys)
+uint64_t binarySearch(DTYPE *input, uint64_t input_size, DTYPE *querys,
+ unsigned n_querys)
{
uint64_t found = -1;
uint64_t q, r, l, m;
-
- #pragma omp parallel for private(q,r,l,m)
- for(q = 0; q < n_querys; q++)
- {
+
+#pragma omp parallel for private(q,r,l,m)
+ for (q = 0; q < n_querys; q++) {
l = 0;
r = input_size;
- while (l <= r)
- {
- m = l + (r - l) / 2;
-
- // Check if x is present at mid
- if (input[m] == querys[q])
- {
- found += m;
+ while (l <= r) {
+ m = l + (r - l) / 2;
+
+ // Check if x is present at mid
+ if (input[m] == querys[q]) {
+ found += m;
break;
}
- // If x greater, ignore left half
- if (input[m] < querys[q])
- l = m + 1;
+ // If x greater, ignore left half
+ if (input[m] < querys[q])
+ l = m + 1;
- // If x is smaller, ignore right half
+ // If x is smaller, ignore right half
else
- r = m - 1;
-
+ r = m - 1;
+
}
- }
+ }
- return found;
+ return found;
}
/**
* @brief Main of the Host Application.
*/
- int main(int argc, char **argv) {
- (void)argc;
+int main(int argc, char **argv)
+{
+ (void)argc;
#if WITH_BENCHMARK
- Timer timer;
+ Timer timer;
#endif
- uint64_t input_size = atol(argv[1]);
- uint64_t n_querys = atol(argv[2]);
+ uint64_t input_size = atol(argv[1]);
+ uint64_t n_querys = atol(argv[2]);
#if NUMA
- bitmask_in = numa_parse_nodestring(argv[3]);
- numa_node_cpu = atoi(argv[4]);
+ bitmask_in = numa_parse_nodestring(argv[3]);
+ numa_node_cpu = atoi(argv[4]);
#endif
#if NUMA_MEMCPY
- bitmask_cpu = numa_parse_nodestring(argv[5]);
- numa_node_cpu_memcpy = atoi(argv[6]);
+ bitmask_cpu = numa_parse_nodestring(argv[5]);
+ numa_node_cpu_memcpy = atoi(argv[6]);
#endif
- printf("Vector size: %lu, num searches: %lu\n", input_size, n_querys);
+ printf("Vector size: %lu, num searches: %lu\n", input_size, n_querys);
#if NUMA
- if (bitmask_in) {
- numa_set_membind(bitmask_in);
- numa_free_nodemask(bitmask_in);
- }
- DTYPE * input = numa_alloc((input_size) * sizeof(DTYPE));
- DTYPE * querys = numa_alloc((n_querys) * sizeof(DTYPE));
+ if (bitmask_in) {
+ numa_set_membind(bitmask_in);
+ numa_free_nodemask(bitmask_in);
+ }
+ DTYPE *input = numa_alloc((input_size) * sizeof(DTYPE));
+ DTYPE *querys = numa_alloc((n_querys) * sizeof(DTYPE));
#else
- DTYPE * input = malloc((input_size) * sizeof(DTYPE));
- DTYPE * querys = malloc((n_querys) * sizeof(DTYPE));
+ DTYPE *input = malloc((input_size) * sizeof(DTYPE));
+ DTYPE *querys = malloc((n_querys) * sizeof(DTYPE));
#endif
#if NUMA
#if NUMA_MEMCPY
- if (bitmask_cpu) {
- numa_set_membind(bitmask_cpu);
- numa_free_nodemask(bitmask_cpu);
- }
+ if (bitmask_cpu) {
+ numa_set_membind(bitmask_cpu);
+ numa_free_nodemask(bitmask_cpu);
+ }
#else
- struct bitmask *bitmask_all = numa_allocate_nodemask();
- numa_bitmask_setall(bitmask_all);
- numa_set_membind(bitmask_all);
- numa_free_nodemask(bitmask_all);
-#endif // NUMA_MEMCPY
+ struct bitmask *bitmask_all = numa_allocate_nodemask();
+ numa_bitmask_setall(bitmask_all);
+ numa_set_membind(bitmask_all);
+ numa_free_nodemask(bitmask_all);
+#endif // NUMA_MEMCPY
#endif
- DTYPE result_host = -1;
+ DTYPE result_host = -1;
- // Create an input file with arbitrary data.
- create_test_file(input, input_size, querys, n_querys);
+ // Create an input file with arbitrary data.
+ create_test_file(input, input_size, querys, n_querys);
#if NUMA
- mp_pages[0] = input;
- 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];
- }
-
- if (numa_node_cpu != -1) {
- if (numa_run_on_node(numa_node_cpu) == -1) {
- perror("numa_run_on_node");
- numa_node_cpu = -1;
- }
- }
+ mp_pages[0] = input;
+ 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];
+ }
+
+ if (numa_node_cpu != -1) {
+ if (numa_run_on_node(numa_node_cpu) == -1) {
+ perror("numa_run_on_node");
+ numa_node_cpu = -1;
+ }
+ }
#endif
#if NUMA_MEMCPY
- numa_node_in_is_local = ((numa_node_cpu == numa_node_in) || (numa_node_cpu + 8 == numa_node_in)) * 1;
+ numa_node_in_is_local = ((numa_node_cpu == numa_node_in)
+ || (numa_node_cpu + 8 == numa_node_in)) * 1;
#endif
#if NUMA_MEMCPY
- DTYPE *input_local = input;
- DTYPE *querys_local = querys;
- start(&timer, 1, 0);
- if (!numa_node_in_is_local) {
- input_local = numa_alloc((input_size) * sizeof(DTYPE));
- querys_local = numa_alloc((n_querys) * sizeof(DTYPE));
- }
- stop(&timer, 1);
- if (!numa_node_in_is_local) {
- if (numa_node_cpu_memcpy != -1) {
- if (numa_run_on_node(numa_node_cpu_memcpy) == -1) {
- perror("numa_run_on_node");
- numa_node_cpu_memcpy = -1;
- }
- }
- }
- start(&timer, 2, 0);
- if (!numa_node_in_is_local) {
- memcpy(input_local, input, input_size * sizeof(DTYPE));
- memcpy(querys_local, querys, n_querys * sizeof(DTYPE));
- } else {
- input_local = input;
- querys_local = querys;
- }
- stop(&timer, 2);
- if (numa_node_cpu != -1) {
- if (numa_run_on_node(numa_node_cpu) == -1) {
- perror("numa_run_on_node");
- numa_node_cpu = -1;
- }
- }
- mp_pages[0] = input_local;
- if (move_pages(0, 1, mp_pages, NULL, mp_status, 0) == -1) {
- perror("move_pages(input_local)");
- }
- else if (mp_status[0] < 0) {
- printf("move_pages error: %d", mp_status[0]);
- }
- else {
- numa_node_local = mp_status[0];
- }
+ DTYPE *input_local = input;
+ DTYPE *querys_local = querys;
+ start(&timer, 1, 0);
+ if (!numa_node_in_is_local) {
+ input_local = numa_alloc((input_size) * sizeof(DTYPE));
+ querys_local = numa_alloc((n_querys) * sizeof(DTYPE));
+ }
+ stop(&timer, 1);
+ if (!numa_node_in_is_local) {
+ if (numa_node_cpu_memcpy != -1) {
+ if (numa_run_on_node(numa_node_cpu_memcpy) == -1) {
+ perror("numa_run_on_node");
+ numa_node_cpu_memcpy = -1;
+ }
+ }
+ }
+ start(&timer, 2, 0);
+ if (!numa_node_in_is_local) {
+ memcpy(input_local, input, input_size * sizeof(DTYPE));
+ memcpy(querys_local, querys, n_querys * sizeof(DTYPE));
+ } else {
+ input_local = input;
+ querys_local = querys;
+ }
+ stop(&timer, 2);
+ if (numa_node_cpu != -1) {
+ if (numa_run_on_node(numa_node_cpu) == -1) {
+ perror("numa_run_on_node");
+ numa_node_cpu = -1;
+ }
+ }
+ mp_pages[0] = input_local;
+ if (move_pages(0, 1, mp_pages, NULL, mp_status, 0) == -1) {
+ perror("move_pages(input_local)");
+ } else if (mp_status[0] < 0) {
+ printf("move_pages error: %d", mp_status[0]);
+ } else {
+ numa_node_local = mp_status[0];
+ }
#endif
#if NOP_SYNC
- for(int rep = 0; rep < 200000; rep++) {
- asm volatile("nop" ::);
- }
+ for (int rep = 0; rep < 200000; rep++) {
+ asm volatile ("nop"::);
+ }
#endif
- start(&timer, 0, 0);
+ start(&timer, 0, 0);
#if NUMA_MEMCPY
- result_host = binarySearch(input_local, input_size - 1, querys_local, n_querys);
+ result_host =
+ binarySearch(input_local, input_size - 1, querys_local, n_querys);
#else
- result_host = binarySearch(input, input_size - 1, querys, n_querys);
+ result_host = binarySearch(input, input_size - 1, querys, n_querys);
#endif
- stop(&timer, 0);
+ stop(&timer, 0);
#if NOP_SYNC
- for(int rep = 0; rep < 200000; rep++) {
- asm volatile("nop" ::);
- }
+ for (int rep = 0; rep < 200000; rep++) {
+ asm volatile ("nop"::);
+ }
#endif
#if NUMA_MEMCPY
- start(&timer, 3, 0);
- if (!numa_node_in_is_local) {
- numa_free(input_local, input_size * sizeof(DTYPE));
- numa_free(querys_local, n_querys * sizeof(DTYPE));
- }
- stop(&timer, 3);
+ start(&timer, 3, 0);
+ if (!numa_node_in_is_local) {
+ numa_free(input_local, input_size * sizeof(DTYPE));
+ numa_free(querys_local, n_querys * sizeof(DTYPE));
+ }
+ stop(&timer, 3);
#endif
- int status = (result_host);
+ int status = (result_host);
#if WITH_BENCHMARK
- unsigned int nr_threads = 0;
+ unsigned int nr_threads = 0;
#pragma omp parallel
#pragma omp atomic
- nr_threads++;
+ nr_threads++;
- if (status) {
+ if (status) {
#if NUMA_MEMCPY
- printf("[::] BS-CPU-MEMCPY | n_threads=%d e_type=%s n_elements=%lu"
- " numa_node_in=%d numa_node_local=%d numa_node_cpu=%d numa_node_cpu_memcpy=%d numa_distance_in_cpu=%d"
- " | throughput_MBps=%f throughput_MOpps=%f"
- " latency_kernel_us=%f latency_alloc_us=%f latency_memcpy_us=%f latency_free_us=%f latency_total_us=%f\n",
- nr_threads, "uint64_t", input_size,
- numa_node_in, numa_node_local, numa_node_cpu, numa_node_cpu_memcpy, numa_distance(numa_node_in, numa_node_cpu),
- n_querys * sizeof(DTYPE) / timer.time[0], n_querys / timer.time[0],
- timer.time[0], timer.time[1], timer.time[2], timer.time[3],
- timer.time[0] + timer.time[1] + timer.time[2] + timer.time[3]);
+ printf
+ ("[::] BS-CPU-MEMCPY | n_threads=%d e_type=%s n_elements=%lu"
+ " numa_node_in=%d numa_node_local=%d numa_node_cpu=%d numa_node_cpu_memcpy=%d numa_distance_in_cpu=%d"
+ " | throughput_MBps=%f throughput_MOpps=%f"
+ " latency_kernel_us=%f latency_alloc_us=%f latency_memcpy_us=%f latency_free_us=%f latency_total_us=%f\n",
+ nr_threads, "uint64_t", input_size, numa_node_in,
+ numa_node_local, numa_node_cpu, numa_node_cpu_memcpy,
+ numa_distance(numa_node_in, numa_node_cpu),
+ n_querys * sizeof(DTYPE) / timer.time[0],
+ n_querys / timer.time[0], timer.time[0], timer.time[1],
+ timer.time[2], timer.time[3],
+ timer.time[0] + timer.time[1] + timer.time[2] +
+ timer.time[3]);
#else
- printf("[::] BS-CPU | n_threads=%d e_type=%s n_elements=%lu"
+ printf("[::] BS-CPU | n_threads=%d e_type=%s n_elements=%lu"
#if NUMA
- " numa_node_in=%d numa_node_cpu=%d numa_distance_in_cpu=%d"
+ " numa_node_in=%d numa_node_cpu=%d numa_distance_in_cpu=%d"
#endif
- " | throughput_MBps=%f",
- nr_threads, "uint64_t", input_size,
+ " | throughput_MBps=%f",
+ nr_threads, "uint64_t", input_size,
#if NUMA
- numa_node_in, numa_node_cpu, numa_distance(numa_node_in, numa_node_cpu),
+ numa_node_in, numa_node_cpu, numa_distance(numa_node_in,
+ numa_node_cpu),
#endif
- n_querys * sizeof(DTYPE) / timer.time[0]);
- printf(" throughput_MOpps=%f latency_us=%f\n",
- n_querys / timer.time[0], timer.time[0]);
+ n_querys * sizeof(DTYPE) / timer.time[0]);
+ printf(" throughput_MOpps=%f latency_us=%f\n",
+ n_querys / timer.time[0], timer.time[0]);
#endif
- } else {
- printf("[ERROR]\n");
- }
-#endif // WITH_BENCHMARK
+ } else {
+ printf("[ERROR]\n");
+ }
+#endif // WITH_BENCHMARK
#if NUMA
- numa_free(input, input_size * sizeof(DTYPE));
- numa_free(querys, n_querys * sizeof(DTYPE));
+ numa_free(input, input_size * sizeof(DTYPE));
+ numa_free(querys, n_querys * sizeof(DTYPE));
#else
- free(input);
- free(querys);
+ free(input);
+ free(querys);
#endif
-
- return status ? 0 : 1;
+ return status ? 0 : 1;
}
-
generated by cgit v1.2.3 (git 2.39.1) at 2025-01-29 16:52:37 +0000