-
Notifications
You must be signed in to change notification settings - Fork 0
/
bench.cc
156 lines (134 loc) · 4.82 KB
/
bench.cc
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
#include <chrono>
#include <fstream>
#include <iostream>
#include <random>
#include "include/cht/builder.h"
#include "include/cht/cht.h"
using namespace std::chrono;
template <class KeyType>
auto RandomNumberBetween = [](KeyType low, KeyType high) {
auto randomFunc =
[distribution_ = std::uniform_int_distribution<KeyType>(low, high),
random_engine_ = std::mt19937{std::random_device{}()}]() mutable {
return distribution_(random_engine_);
};
return randomFunc;
};
template <class KeyType>
static std::vector<KeyType> Generate(unsigned size, KeyType maxValue,
bool withSort = false) {
std::vector<KeyType> numbers;
std::generate_n(std::back_inserter(numbers), size / 4,
RandomNumberBetween<KeyType>(0, maxValue / 4));
std::generate_n(std::back_inserter(numbers), size / 2,
RandomNumberBetween<KeyType>(maxValue / 4, maxValue / 2));
std::generate_n(std::back_inserter(numbers), size / 4,
RandomNumberBetween<KeyType>(maxValue / 2, maxValue));
if (withSort) sort(std::begin(numbers), std::end(numbers));
return numbers;
}
template <class KeyType>
void CreateInput(std::vector<KeyType>& keys, std::vector<KeyType>& queries) {
keys = Generate(1e6, std::numeric_limits<KeyType>::max(), true);
queries = Generate(1e6, std::numeric_limits<KeyType>::max());
std::cout << "Generated " << keys.size() << " keys and " << queries.size()
<< " lookup keys!" << std::endl;
}
template <class KeyType>
void Compare() {
std::vector<KeyType> keys, queries;
CreateInput<KeyType>(keys, queries);
#if 1
std::ofstream out("compare_keys.out");
for (unsigned index = 0; index != keys.size(); ++index)
out << keys[index] << std::endl;
out << std::endl;
#endif
for (unsigned i = 1; i <= 10; ++i) {
for (unsigned j = 1; j <= 10; ++j) {
auto numBins = 1u << i, maxError = 1u << j;
std::cerr << "numBins=" << numBins << " maxError=" << maxError
<< std::endl;
// Build both CHTs
KeyType min = keys.front();
KeyType max = keys.back();
cht::Builder<KeyType> spchtb(min, max, numBins, maxError, true, false);
cht::Builder<KeyType> ochtb(min, max, numBins, maxError, false, false);
for (const auto& key : keys) spchtb.AddKey(key), ochtb.AddKey(key);
auto spcht = spchtb.Finalize();
auto ocht = ochtb.Finalize();
// Compare pure lookups
auto Compare = [&]() -> void {
for (auto query : queries) {
auto b1 = spcht.GetSearchBound(query);
auto b2 = ocht.GetSearchBound(query);
assert(b1.first == b2.first && b1.second == b2.second);
}
};
Compare();
}
}
}
template <class KeyType>
void Benchmark(bool single_pass) {
std::vector<KeyType> keys, queries;
CreateInput<KeyType>(keys, queries);
#if 1
std::ofstream out("benchmark_keys.out");
for (unsigned index = 0; index != keys.size(); ++index)
out << keys[index] << std::endl;
out << std::endl;
#endif
for (unsigned i = 1; i <= 10; ++i) {
for (unsigned j = 1; j <= 10; ++j) {
auto numBins = 1u << i, maxError = 1u << j;
// Build both CHTs
KeyType min = keys.front();
KeyType max = keys.back();
cht::Builder<KeyType> chtb(min, max, numBins, maxError, single_pass,
false);
cht::Builder<KeyType> cchtb(min, max, numBins, maxError, single_pass,
true);
for (const auto& key : keys) chtb.AddKey(key), cchtb.AddKey(key);
auto cht = chtb.Finalize();
auto ccht = cchtb.Finalize();
// Compare pure lookups
auto measureTime = [&](std::string type) -> void {
auto start = high_resolution_clock::now();
if (type == "CHT") {
for (auto query : queries) {
cht.GetSearchBound(query);
}
} else if (type == "CCHT") {
for (auto query : queries) {
ccht.GetSearchBound(query);
}
}
auto stop = high_resolution_clock::now();
double answer = duration_cast<nanoseconds>(stop - start).count();
std::cout << type << "<"
<< (std::is_same<KeyType, uint32_t>::value ? "uint32_t"
: "uint64_t")
<< ">(numBins=" << numBins << ", maxError=" << maxError
<< ", single_pass=" << single_pass << "): " << answer << " ns"
<< std::endl;
};
for (unsigned index = 0; index != 5; ++index) {
measureTime("CHT");
measureTime("CCHT");
}
}
}
}
int main(void) {
#if 0
Compare<uint32_t>();
Compare<uint64_t>();
#endif
// Benchmark (needs big RAM)
Benchmark<uint32_t>(true);
Benchmark<uint64_t>(true);
Benchmark<uint32_t>(false);
Benchmark<uint64_t>(false);
return 0;
}