-
Notifications
You must be signed in to change notification settings - Fork 0
/
driver.cpp
333 lines (257 loc) · 9.09 KB
/
driver.cpp
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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
#include <iostream>
#include <chrono>
#include <vector>
#include <thread>
#include <atomic>
#include <random>
#include <getopt.h>
#include <string.h>
#include "sequential.cpp"
#include "concurrent.cpp"
#include "transactional.cpp"
enum implementation_t {
sequential = 1,
concurrent = 2,
transactional = 3
};
struct config {
// Maximum key size
int range;
// Initial table size
int size;
// Number of items to populate the table with
int population;
// Number of operations to run
int operations;
// The number of threads for which a test should run
int threads;
// Seed for the random number generator
int seed;
// Number of locks to use for concurrent striping implementations
int locks;
// Imlementation to run (sequential, concurrent, transactional)
implementation_t implementation;
config() {
range = INT32_MAX;
size = pow(2, 21);
population = pow(2, 20);
operations = 1000000;
threads = 1;
seed = rand();
locks = (size / 8);
implementation = sequential;
}
};
struct results {
std::atomic<int> add_true;
std::atomic<int> add_false;
std::atomic<int> remove_true;
std::atomic<int> remove_false;
std::atomic<int> contains_true;
std::atomic<int> contains_false;
results() {
contains_true = 0;
contains_false = 0;
add_true = 0;
add_false = 0;
remove_true = 0;
remove_false = 0;
}
};
void parseargs(int argc, char** argv, config& cfg) {
int opt;
while ((opt = getopt(argc, argv, "r:s:p:o:t:x:l:i:")) != -1) {
switch (opt) {
case 'r': cfg.range = atoi(optarg); break;
case 's': cfg.size = atoi(optarg); break;
case 'p': cfg.population = atoi(optarg); break;
case 'o': cfg.operations = atoi(optarg); break;
case 't': cfg.threads = atoi(optarg); break;
case 'x': cfg.seed = atoi(optarg); break;
case 'l': cfg.locks = atoi(optarg); break;
case 'i':
if (!strcmp(optarg, "sequential")) {
cfg.implementation = sequential;
}
else if (!strcmp(optarg, "concurrent")) {
cfg.implementation = concurrent;
}
else if (!strcmp(optarg, "transactional")) {
cfg.implementation = transactional;
}
else {
std::cout << "Available implementations are: 'sequential', 'concurrent', or 'transactional'" << std::endl;
exit(1);
};
break;
}
}
}
// Shared RNG
std::default_random_engine generator;
// Uniform distributions for both the value and operation workload generation
std::uniform_int_distribution<int> value_distribution;
std::uniform_int_distribution<int> operation_distribution;
std::vector<std::vector<char>> op_distributions(config cfg) {
std::vector<std::vector<char>> dists;
for (int t = 0; t < cfg.threads; t++) {
std::vector<char> dist;
int opcount = 2 * (cfg.operations / cfg.threads);
for (int i = 0; i < opcount; ++i) {
int op = operation_distribution(generator);
if (op < 10) {
dist.push_back('a');
} else if (op < 20) {
dist.push_back('r');
} else if (op < 100) {
dist.push_back('c');
}
}
dists.push_back(dist);
}
return dists;
}
std::vector<std::vector<int>> val_distributions(config cfg) {
std::vector<std::vector<int>> dists;
for (int t = 0; t < cfg.threads; t++) {
std::vector<int> dist;
int opcount = 2 * (cfg.operations / cfg.threads);
for (int i = 0; i < opcount; ++i) {
int op = value_distribution(generator);
dist.push_back(op);
}
dists.push_back(dist);
}
return dists;
}
int random_int() {
return value_distribution(generator);
}
std::atomic<int> total_operations;
void do_work(set<int>* int_set, results &res, config cfg, std::vector<char> &op_dist, std::vector<int> &val_dist) {
auto op_iter = op_dist.begin();
auto val_iter = val_dist.begin();
int add_true = 0;
int add_false = 0;
int remove_true = 0;
int remove_false = 0;
int contains_true = 0;
int contains_false = 0;
while(++total_operations < cfg.operations + 1) {
switch (*op_iter) {
case 'a':
{
//std::cout << "a : " << *val_iter << std::endl;
if(int_set->add(*val_iter)) {
add_true++;
} else {
add_false++;
}
break;
}
case 'r':
{
//std::cout << "r : " << *val_iter << std::endl;
if(int_set->remove(*val_iter)) {
remove_true++;
} else {
remove_false++;
}
break;
}
case 'c':
{
//std::cout << "c : " << *val_iter << std::endl;
if(int_set->contains(*val_iter)) {
contains_true++;
} else {
contains_false++;
}
break;
}
default:
break;
}
val_iter++;
op_iter++;
}
res.add_true += add_true;
res.add_false += add_false;
res.remove_true += remove_true;
res.remove_false += remove_false;
res.contains_true += contains_true;
res.contains_false += contains_false;
return;
}
int main(int argc, char** argv) {
const int limit = 1000;
config cfg;
parseargs(argc, argv, cfg);
std::cout << std::endl << ".____________." << std::endl;
std::cout << "| |" << std::endl;
std::cout << "| Parameters |" << std::endl;
std::cout << "|____________|" << std::endl << std::endl;
std::cout << "[implementation]: " << cfg.implementation << std::endl;
std::cout << "[range]: " << cfg.range << std::endl;
std::cout << "[size]: " << cfg.size << std::endl;
std::cout << "[population]: " << cfg.population << std::endl;
std::cout << "[operations]: " << cfg.operations << std::endl;
std::cout << "[threads]: " << cfg.threads << std::endl;
std::cout << "[seed]: " << cfg.seed << std::endl << std::endl;
set<int>* int_set = NULL;
generator = std::default_random_engine(cfg.seed);
value_distribution = std::uniform_int_distribution<int>(0, cfg.range);
operation_distribution = std::uniform_int_distribution<int>(0, 99);
switch(cfg.implementation){
case sequential:
int_set = new sequential_set<int>(cfg.size, limit);
cfg.threads = 1;
break;
case concurrent:
int_set = new concurrent_set<int>(cfg.size, cfg.locks, limit);
break;
case transactional:
int_set = new transactional_set<int>(cfg.size, limit);
break;
default:
break;
}
std::vector<std::thread> threads;
results res;
int_set->populate(cfg.population, &random_int);
std::cout << "[list populated]" << std::endl;
std::vector<std::vector<char>> op_dists = op_distributions(cfg);
std::vector<std::vector<int>> val_dists = val_distributions(cfg);
auto start = std::chrono::high_resolution_clock::now();
if (cfg.threads == 1) {
do_work(int_set, res, cfg, op_dists[0], val_dists[0]);
} else {
for (int i = 0; i < cfg.threads; ++i) {
threads.push_back(std::thread(&do_work, int_set, std::ref(res), cfg, std::ref(op_dists[i]), std::ref(val_dists[i])));
}
for (int i = 0; i < cfg.threads; ++i) {
threads.at(i).join();
}
}
auto end = std::chrono::high_resolution_clock::now();
std::chrono::microseconds elapsed = std::chrono::duration_cast<std::chrono::microseconds>(end - start);
auto time = elapsed.count();
int set_size = int_set->size();
// Print the results
std::cout << "._________." << std::endl;
std::cout << "| |" << std::endl;
std::cout << "| Results |" << std::endl;
std::cout << "|_________|" << std::endl << std::endl;
std::cout << "[add_true]: " << res.add_true << std::endl;
std::cout << "[add_false]: " << res.add_false << std::endl << std::endl;
std::cout << "[remove_true]: " << res.remove_true << std::endl;
std::cout << "[remove_false]: " << res.remove_false << std::endl << std::endl;
std::cout << "[contains_true]: " << res.contains_true << std::endl;
std::cout << "[contains_false]: " << res.contains_false << std::endl << std::endl;
std::cout << "[total_operations]: " << res.add_true + res.add_false + res.remove_true + res.remove_false + res.contains_true + res.contains_false << std::endl << std::endl;
std::cout << "[expected_size]: " << cfg.population + res.add_true - res.remove_true << std::endl;
std::cout << "[actual_size]: " << set_size << std::endl << std::endl;
std::cout << "[execution_time]: " << time << std::endl;
delete int_set;
return 0;
}