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
|
#include "include/bench.h"
#include "ds/BTree.h"
static void btree_sample_bench(TreeMap &tree, std::vector<de::irs_query_parms<btree_record>> queries, size_t trial_cnt=10)
{
char progbuf[25];
sprintf(progbuf, "sampling:");
size_t batch_size = 100;
size_t batches = trial_cnt / batch_size;
size_t total_time = 0;
std::vector<key_type> sample_set;
sample_set.reserve(queries[0].sample_size);
for (int i=0; i<trial_cnt; i++) {
progress_update((double) (i * batch_size) / (double) trial_cnt, progbuf);
auto start = std::chrono::high_resolution_clock::now();
for (size_t j=0; j<queries.size(); j++) {
tree.range_sample(queries[j].lower_bound, queries[j].upper_bound, queries[j].sample_size, sample_set, g_rng);
}
auto stop = std::chrono::high_resolution_clock::now();
total_time += std::chrono::duration_cast<std::chrono::nanoseconds>(stop - start).count();
}
progress_update(1.0, progbuf);
size_t latency = total_time / (trial_cnt * queries.size());
fprintf(stdout, "%ld\t", latency);
}
int main(int argc, char **argv)
{
if (argc < 5) {
fprintf(stderr, "Usage: btree_irs_bench <filename> <record_count> <delete_proportion> <query_file>\n");
exit(EXIT_FAILURE);
}
std::string filename = std::string(argv[1]);
size_t record_count = atol(argv[2]);
double delete_prop = atof(argv[3]);
std::string qfilename = std::string(argv[4]);
size_t buffer_cap = 12000;
size_t scale_factor = 6;
double max_delete_prop = delete_prop;
bool use_osm = false;
double insert_batch = 0.1;
init_bench_env(record_count, true, use_osm);
auto queries = read_range_queries<de::irs_query_parms<btree_record>>(qfilename, .001);
for (auto &q: queries) {
q.rng = g_rng;
q.sample_size = 1000;
}
auto btree = TreeMap();
std::fstream datafile;
datafile.open(filename, std::ios::in | std::ios::binary);
std::vector<btree_record> to_delete;
// warm up the tree with initial_insertions number of initially inserted
// records
size_t warmup_cnt = insert_batch * record_count;
warmup<TreeMap, btree_record>(datafile, btree, warmup_cnt, delete_prop, to_delete, true, true);
size_t insert_cnt = record_count - warmup_cnt;
insert_tput_bench<TreeMap, btree_record>(btree, datafile, insert_cnt, delete_prop, to_delete, true);
size_t memory_usage = btree.get_stats().inner_nodes * tlx::btree_default_traits<key_type, btree_record>::inner_slots * (sizeof(key_type) + sizeof(void*));
memory_usage += btree.get_stats().leaves * tlx::btree_default_traits<key_type, btree_record>::leaf_slots * sizeof(btree_record);
fprintf(stdout, "%ld\t", memory_usage);
btree_sample_bench(btree, queries);
fprintf(stdout, "\n");
delete_bench_env();
fflush(stdout);
fflush(stderr);
exit(EXIT_SUCCESS);
}
|