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
|
/*
*
*/
#define ENABLE_TIMER
#include <thread>
#include "framework/DynamicExtension.h"
#include "shard/ISAMTree.h"
#include "query/rangecount.h"
#include "framework/interface/Record.h"
#include "psu-util/timer.h"
typedef de::Record<int64_t, int64_t> Rec;
typedef de::ISAMTree<Rec> ISAM;
typedef de::rc::Query<ISAM, Rec> Q;
typedef de::DynamicExtension<Rec, ISAM, Q> Ext;
volatile std::atomic<bool> queries_done;
void query_thread(Ext *extension, double selectivity, size_t k) {
TIMER_INIT();
size_t reccnt = extension->get_record_count();
size_t range = reccnt * selectivity;
auto q = new de::rc::Parms<Rec>();
TIMER_START();
for (int64_t i=0; i<k; i++) {
size_t start = rand() % (reccnt - range);
q->lower_bound = start;
q->upper_bound = start + range;
auto res = extension->query(q);
auto r = res.get();
}
TIMER_STOP();
auto query_lat = TIMER_RESULT();
fprintf(stdout, "Q\t%ld\t%ld\t%ld\n", reccnt, query_lat, k);
delete q;
}
Ext *build_structure(size_t n) {
auto extension = new Ext(1000, 10000, 2);
size_t i=0;
Rec r;
do {
r.key = rand() % n;
r.value = i;
if (extension->insert(r)) {
i++;
} else {
_mm_pause();
}
} while (i < n);
extension->await_next_epoch();
return extension;
}
void query_benchmark(double selectivity, size_t k, Ext *extension, size_t query_thrd_cnt) {
TIMER_INIT();
std::vector<std::thread> thrds(query_thrd_cnt);
TIMER_START();
for (size_t i=0; i<query_thrd_cnt; i++) {
thrds[i] = std::thread(query_thread, extension, selectivity, k);
}
for (size_t i=0; i<query_thrd_cnt; i++) {
thrds[i].join();
}
TIMER_STOP();
auto query_lat = TIMER_RESULT();
fprintf(stdout, "Q\t%ld\t%ld\t%ld\t%ld\n", extension->get_record_count(), query_lat, k, query_thrd_cnt);
queries_done.store(true);
}
int main(int argc, char **argv) {
/* the closeout routine takes _forever_ ... so we'll just leak the memory */
size_t n = 10000000;
size_t per_trial = 1000;
double selectivity = .001;
/* build initial structure */
auto extension = build_structure(n);
std::vector<size_t> thread_counts = {8, 16, 32, 64, 128};
for (auto &threads : thread_counts) {
/* benchmark queries w/o any interference from reconstructions */
query_benchmark(selectivity, per_trial, extension, threads);
fprintf(stderr, "Running interference test...\n");
queries_done.store(false);
/* trigger a worst-case reconstruction and benchmark the queries */
std::thread q_thrd(query_benchmark, selectivity, per_trial, extension, threads);
while (!queries_done.load()) {
auto s = extension->create_static_structure();
delete s;
}
fprintf(stderr, "Construction complete\n");
q_thrd.join();
}
extension->print_scheduler_statistics();
delete extension;
fflush(stderr);
}
|