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
|
/*
*
*/
#include <cstdlib>
#define ENABLE_TIMER
#define TS_TEST
#include <thread>
#include "file_util.h"
#include "framework/DynamicExtension.h"
#include "framework/interface/Record.h"
#include "framework/scheduling/FIFOScheduler.h"
#include "framework/scheduling/SerialScheduler.h"
#include "framework/util/Configuration.h"
#include "query/pointlookup.h"
#include "shard/ISAMTree.h"
#include "standard_benchmarks.h"
#include "util/types.h"
#include "framework/reconstruction/FixedShardCountPolicy.h"
#include <gsl/gsl_rng.h>
#include "psu-util/timer.h"
typedef de::Record<uint64_t, uint64_t> Rec;
typedef de::ISAMTree<Rec> Shard;
typedef de::pl::Query<Shard> Q;
typedef de::DynamicExtension<Shard, Q, de::DeletePolicy::TOMBSTONE,
de::FIFOScheduler>
Ext;
typedef Q::Parameters QP;
typedef de::DEConfiguration<Shard, Q, de::DeletePolicy::TOMBSTONE,
de::FIFOScheduler>
Conf;
std::atomic<size_t> idx;
std::atomic<bool> inserts_done = false;
ssize_t query_ratio = 0;
std::atomic<size_t> total_res = 0;
size_t reccnt = 0;
size_t g_thrd_cnt = 0;
std::atomic<size_t> total_insert_time = 0;
std::atomic<size_t> total_insert_count = 0;
std::atomic<size_t> total_query_time = 0;
std::atomic<size_t> total_query_count = 0;
void insert_thread(Ext *extension, std::vector<Rec> *records, size_t start_idx,
size_t stop_idx, gsl_rng *rng) {
TIMER_INIT();
for (size_t i = start_idx; i < stop_idx; i++) {
TIMER_START();
while (!extension->insert((*records)[i], rng)) {
usleep(1);
}
TIMER_STOP();
fprintf(stdout, "I\t%ld\n", TIMER_RESULT());
}
}
void usage(char *progname) {
fprintf(stderr, "%s reccnt datafile rate_limit policy\n", progname);
}
int main(int argc, char **argv) {
if (argc < 5) {
usage(argv[0]);
exit(EXIT_FAILURE);
}
size_t n = atol(argv[1]);
std::string d_fname = std::string(argv[2]);
double rate_limit = std::atof(argv[3]);
size_t pol = std::atol(argv[4]);
assert(pol >= 0 && pol <= 6);
auto data = read_sosd_file<Rec>(d_fname, n);
size_t buffer_size = 8000;
size_t scale_factor = 8;
double modifier = 0;
size_t insert_threads = 1;
size_t internal_thread_cnt = 32;
reccnt = n;
gsl_rng *rng = gsl_rng_alloc(gsl_rng_mt19937);
auto policy = get_policy<Shard, Q>(scale_factor, buffer_size, pol, n, modifier);
auto config = Conf(std::move(policy));
config.recon_enable_maint_on_flush = true;
config.recon_maint_disabled = false;
// config.buffer_flush_trigger = 4000;
config.maximum_threads = internal_thread_cnt;
g_thrd_cnt = internal_thread_cnt;
total_insert_time.store(0);
total_query_time.store(0);
total_query_count.store(0);
auto extension = new Ext(std::move(config), rate_limit);
/* warmup structure w/ 30% of records */
size_t warmup = .3 * n;
for (size_t k = 0; k < warmup; k++) {
while (!extension->insert(data[k])) {
usleep(1);
}
}
extension->await_version();
idx.store(warmup);
std::thread i_thrds[insert_threads];
size_t per_insert_thrd = (n - warmup) / insert_threads;
size_t start = warmup;
for (size_t i = 0; i < insert_threads; i++) {
i_thrds[i] = std::thread(insert_thread, extension, &data, start,
start + per_insert_thrd, rng);
start += per_insert_thrd;
}
for (size_t i = 0; i < insert_threads; i++) {
i_thrds[i].join();
}
inserts_done.store(true);
inserts_done.store(false);
delete extension;
fflush(stderr);
}
|