-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfaster.cpp
More file actions
413 lines (306 loc) · 9.94 KB
/
faster.cpp
File metadata and controls
413 lines (306 loc) · 9.94 KB
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
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
#include <iostream>
#include <string>
#include <fstream>
#include <sstream>
#include <omp.h>
#include <random>
#include <bitset>
#include <math.h>
#include <algorithm>
//#define totalShingles (1ULL<<32)-1
#define totalShingles (1<<31)-1
std::random_device rd;
std::mt19937 e{rd()}; // or std::default_random_engine e{rd()};
std::uniform_int_distribution<int> dist{1, totalShingles};
#define K 1024
#define NO_THREADS 60
struct comparison{
double score;
std::string name;
int set1;
int set2;
};
void hash_parameter(int* randList){
int cursor = 0;
int randIndex = dist(e);
randList[cursor] = randIndex;
int k = K;
while(k > 0){
randList[cursor] = dist(e);
cursor += 1;
k -= 1;
}
}
bool compareComparisons(comparison a, comparison b)
{
return a.score > b.score;
}
void insert_one_set(int* set, int* randomNoA, int* randomNoB, char* &setVals, std::bitset<K> &setSigs, int data_cardinal){
for(int i = 0; i < K; i++){
setVals[i] = -1;
//std::cout << "Setting: " << (int)setAvals[i] << std::endl;
}
//For Set A
for(int i = 0; i < data_cardinal; i++){
//std::cout << "data cardinal: " << i << std::endl;
for(int x = 0; x < K; x++){
double temp = (randomNoA[x] * set[i] + randomNoB[x]) % totalShingles;
if(temp <= 0)
temp += totalShingles;
temp /= totalShingles;
//std::cout << "Temp: " << temp << std::endl;
double log_temp = log2(temp);
log_temp = -1*log_temp;
//std::cout << "Log Temp: " << log_temp << std::endl;
int hash_val = ceil(log_temp);
if(hash_val > setVals[x]){
setVals[x] = hash_val;
setSigs[x] = 1;
//std::cout << "Just setting: " << (int)setVals[x] << " ||| " << setSigs[x] << std::endl;
}
else if(hash_val == setVals[x]){
setSigs[x] = 0;
}
}
}
/*
for(int i = 0; i < 10; i++){
std::cout << "In Insert: " << setVals[i] << " " << setSigs[i] << std::endl;
}
*/
}
void MaxLog(int* setA, int* setB, int* randomNoA, int* randomNoB,
char* setAvals, char* setBvals,
std::bitset<K> &setAsigs, std::bitset<K> &setBsigs, int cardinal){
for(int i = 0; i < K; i++){
setAvals[i] = -1;
//std::cout << "Setting: " << (int)setAvals[i] << std::endl;
setBvals[i] = -1;
}
//For Set A
for(int i = 0; i < cardinal; i++){
for(int x = 0; x < K; x++){
double temp = (randomNoA[x] * setA[i] + randomNoB[x]) % totalShingles;
if(temp <= 0)
temp += totalShingles;
temp /= totalShingles;
//std::cout << "Temp: " << temp << std::endl;
double log_temp = log2(temp);
log_temp = -1*log_temp;
//std::cout << "Log Temp: " << log_temp << std::endl;
int hash_val = ceil(log_temp);
//std::cout << "Hash val: " << hash_val << " " << (int)setAvals[x] << std::endl;
std::cout << "Hash val: " << hash_val << " " << (int)setAvals[x] << std::endl;
if(hash_val > setAvals[x]){
setAvals[x] = hash_val;
setAsigs[x] = 1;
std::cout << "Just setting: " << setAsigs[x] << std::endl;
}
else if(hash_val == setAvals[x]){
setAsigs[x] = 0;
}
}
}
//For Set B
for(int i = 0; i < cardinal; i++){
for(int x = 0; x < K; x++){
double temp = (randomNoA[x] * setB[i] + randomNoB[x]) % totalShingles;
if(temp <= 0)
temp += totalShingles;
temp /= totalShingles;
//std::cout << "Temp: " << temp << std::endl;
double log_temp = log2(temp);
log_temp = -1*log_temp;
//std::cout << "Log Temp: " << log_temp << std::endl;
int hash_val = ceil(log_temp);
if(hash_val > setBvals[x]){
setBvals[x] = hash_val;
setBsigs[x] = 1;
}
else if(hash_val == setBvals[x]){
setBsigs[x] = 0;
}
}
}
/*
for(int i = 0; i < k; i++){
std::cout << "SetA val " << i << ": " << (int)setAvals[i] << " sig: " << setAsigs[i] << std::endl;
}*/
}
double estimate(char* setAvals, char* setBvals, std::bitset<K> setAsigs, std::bitset<K> setBsigs){
double jaccard_similarity = 0;
int con = 0;
for(int i = 0; i < K ; i++){
//std::cout << "i: " << i << std::endl;
//std::cout << "i:" << i << "setAvals[i]: " << (int)setAvals[i] << " setAsigs[i]: " << setAsigs[i] <<
//" setBvals[i]: " << (int)setBvals[i] << " setBsigs[i]: " << setBsigs[i] << std::endl;
if((setAvals[i] > setBvals[i]) && (setAsigs[i] == 1)){
con += 1;
}
else if((setAvals[i] < setBvals[i]) && (setBsigs[i] == 1)){
con += 1;
}
else{
//std::cout << "setAvals: " << (int)setAvals[i] << " " << (int)setBvals[i] << " " << setAsigs[i] << " " << setBsigs[i] << std::endl;
;
}
}
double dk = K;
double cofactor = 1.0/0.7213;
//std::cout << "Con: " << con << std::endl;
jaccard_similarity = 1.0 - con*(1/dk) * (1/0.7213);
//std::cout << "con: " << con << " dk: " << dk << std::endl;
//std::cout << "Similarity is: " << jaccard_similarity << std::endl;
return jaccard_similarity;
}
int main(int argc, char** argv){
//std::fstream filer(argv[1]);
//int k = std::atoi(argv[2]);
//int k = 1024;
int data_cardinal;
int set_cardinal;
int value;
//filer >> set_cardinal;
std::ifstream file(argv[1]);
std::stringstream ss;
int start_counter = 0;
int set_counter = -1;
int card_counter = 0;
int** sets;
int* set_sizes;
if (file.is_open()) {
std::string line;
while (std::getline(file, line)) {
//std::cout << line << std::endl;
if(start_counter == 0){
ss << line;
ss >> value;
set_cardinal = value;
sets = new int*[set_cardinal];
set_sizes = new int[set_cardinal];
start_counter++;
}
else{
std::stringstream sss(line);
int set_cardinality_counter = 0;
int cursor = 0;
while(!sss.eof()){
sss >> value;
//std::cout << "value: " << value << std::endl;
if(set_cardinality_counter == 0){
//std::cout << "Allocating: " << value << std::endl;
sets[set_counter] = new int[value];
set_sizes[set_counter] = value;
set_cardinality_counter++;
}
else{
//std::cout << "About to explode" << std::endl;
sets[set_counter][cursor] = value;
cursor++;
}
}
}
set_counter++;
}
file.close();
}
//std::cout << "Cardinality of stream: " << data_cardinal << std::endl;
std::cout << "Cardinality of set size: " << set_cardinal << std::endl;
int* randomNoA = new int[K+1];
int* randomNoB = new int[K+1];
hash_parameter(randomNoA);
hash_parameter(randomNoB);
/*for(int i = 0; i < k; i++){
std::cout << "Rand a: " << randomNoA[i] << " Rand b: " << randomNoB[i] << std::endl;
}*/
char** setVals = new char*[set_cardinal];
for(int i = 0; i < set_cardinal; i++){
setVals[i] = new char[K];
}
std::bitset<K>* setSigs = new std::bitset<K>[set_cardinal];
/*
char* setAvals = new char[k];
std::bitset<16> setAsigs;
char* setBvals = new char[k];
std::bitset<16> setBsigs;
*/
/*
for(int i = 0; i < 10; i++){
std::cout << sets[0][i] << std::endl;
}
*/
double sims_zero[128];
double start = omp_get_wtime();
#pragma omp parallel num_threads(NO_THREADS)
{
#pragma omp for schedule(guided)
for(int i = 0; i < set_cardinal; i++){
insert_one_set(sets[i], randomNoA, randomNoB, setVals[i], setSigs[i], set_sizes[i]);
//std::cout << "Sketched set " << i << std::endl;
}
}
double insert = omp_get_wtime() - start;
double cp = omp_get_wtime();
#pragma omp parallel num_threads(NO_THREADS)
{
#pragma omp for schedule(guided)
for(int i = 1; i < set_cardinal; i++){
double estimation = estimate(setVals[0], setVals[i], setSigs[0], setSigs[i]);
sims_zero[i-1] = estimation;
}
}
double estimate_duration = omp_get_wtime() - cp;
for(int i = 1; i < set_cardinal; i++){
std::cout << "Vs " << i << ": " << sims_zero[i] << std::endl;
}
std::cout << "Insert Time: " << insert << std::endl;
std::cout << "Estimate Time: " << estimate_duration << std::endl;
int unique_counter = 0;
for(int i = 0; i < set_cardinal; i++){
for(int c = i+1; c < set_cardinal; c++){
unique_counter++;
//std::cout << i << "," << c << std::endl;
}
}
std::cout << "Unique counter: " << unique_counter << std::endl;
int comp_counter = 0;
comparison* comparisons = new comparison[unique_counter];
std::pair<int,int> *memory = new std::pair<int,int>[unique_counter];
for(int i = 0; i < set_cardinal; i++){
for(int c = i+1; c < set_cardinal; c++){
std::string s1 = std::to_string(i);
std::string s2 = std::to_string(c);
std::string comp_name = s1 + "v" + s2;
comparisons[comp_counter].name = comp_name;
memory[comp_counter].first = i;
memory[comp_counter].second = c;
comp_counter++;
}
}
std::cout << "Name: " << comparisons[23].name << std::endl;
#pragma omp parallel num_threads(NO_THREADS)
{
#pragma omp for schedule(guided)
for(int i = 0; i < unique_counter; i++){
double estimation = estimate(setVals[memory[i].first], setVals[memory[i].second], setSigs[memory[i].first], setSigs[memory[i].second]);
comparisons[i].score = estimation;
comparisons[i].set1 = memory[i].first;
comparisons[i].set2 = memory[i].second;
}
}
double estimate = omp_get_wtime() - cp;
std::sort(comparisons, comparisons+unique_counter, compareComparisons);
for(int i = 0; i < unique_counter; i++){
if(comparisons[i].set2 == 126)
std::cout << comparisons[i].name << "->" << comparisons[i].score << std::endl;
}
std::cout << "Estimation Time: " << estimate << std::endl;
std::cout << "Total Time: " << estimate + insert << std::endl;
int total_elem = 0;
for(int i = 0; i < set_cardinal; i++){
total_elem += set_sizes[i];
}
double throughput = total_elem/insert;
std::cout << "Throughput: " << throughput << " integers, " << throughput/250000 << "Mb/s" << std::endl;
return 0;
}