1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <unistd.h>
#include <getopt.h>
#include <assert.h>
#include <time.h>
#include <stdint.h>
#include "timer.h"
#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) {
uint64_t max = UINT64_MAX;
uint64_t min = 0;
srand(time(NULL));
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 - 2)];
}
}
/**
* @brief compute output in the host
*/
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++)
{
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;
break;
}
// If x greater, ignore left half
if (input[m] < querys[q])
l = m + 1;
// If x is smaller, ignore right half
else
r = m - 1;
}
}
return found;
}
/**
* @brief Main of the Host Application.
*/
int main(int argc, char **argv) {
Timer timer;
uint64_t input_size = atol(argv[1]);
uint64_t n_querys = atol(argv[2]);
printf("Vector size: %lu, num searches: %lu\n", input_size, n_querys);
DTYPE * input = malloc((input_size) * sizeof(DTYPE));
DTYPE * querys = malloc((n_querys) * sizeof(DTYPE));
DTYPE result_host = -1;
// Create an input file with arbitrary data.
create_test_file(input, input_size, querys, n_querys);
start(&timer, 0, 0);
result_host = binarySearch(input, input_size - 1, querys, n_querys);
stop(&timer, 0);
unsigned int nr_threads = 0;
#pragma omp parallel
#pragma omp atomic
nr_threads++;
int status = (result_host);
if (status) {
printf("[::] BS CPU | n_threads=%d e_type=%s n_elements=%d "
"| throughput_MBps=%f",
nr_threads, "uint64_t", input_size,
n_querys * sizeof(DTYPE) / timer.time[0]);
printf(" throughput_MOpps=%f",
nr_threads, "uint64_t", input_size,
n_querys / timer.time[0]);
printall(&timer, 0);
} else {
printf("[ERROR]\n");
}
free(input);
return status ? 0 : 1;
}
|
