-
Notifications
You must be signed in to change notification settings - Fork 0
/
distribution.c
155 lines (130 loc) · 3.16 KB
/
distribution.c
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
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <assert.h>
#include "defs.h"
#include "globals.h"
#if !defined(__MTA__)
#include "compat/xmt-ops.h"
#endif
#include <sys/mman.h>
#include "stinger-atomics.h"
void calculateDegreeDistributions(graph *G)
{
int64_t sum = 0, sum_sq = 0;
double average, avg_sq, variance, std_dev;
int64_t maxDegree = 0;
int64_t i;
#ifdef __MTA__
for (i = 0; i < G->numVertices; i++) {
int64_t degree = G->edgeStart[i+1] - G->edgeStart[i];
sum_sq += degree*degree;
sum += degree;
if (degree > maxDegree)
maxDegree = degree;
}
#else
OMP("omp parallel")
{
int64_t myMaxDegree = 0;
OMP("omp for reduction(+:sum_sq) reduction(+:sum)")
for (i = 0; i < G->numVertices; i++) {
int64_t degree = G->edgeStart[i+1] - G->edgeStart[i];
sum_sq += degree*degree;
sum += degree;
if (degree > myMaxDegree)
myMaxDegree = degree;
}
if (myMaxDegree > maxDegree)
{
OMP("omp critical")
{
if (myMaxDegree > maxDegree) maxDegree = myMaxDegree;
}
}
}
#endif
average = (double) sum / G->numVertices;
avg_sq = (double) sum_sq / G->numVertices;
variance = avg_sq - (average*average);
std_dev = sqrt(variance);
printf("Maximum out-degree is: %ld\n", maxDegree);
printf("Average out-degree is: %f\n", average);
printf("Expected value of X^2: %f\n", avg_sq);
printf("Variance is: %f\n", variance);
printf("Standard deviation: %f\n", std_dev);
}
void calculateComponentDistributions(graph *G, int64_t numColors, int64_t *max, int64_t *maxV)
{
int64_t *cardinality;
int64_t sum = 0, sum_sq = 0;
double average, avg_sq, variance, std_dev;
int64_t i;
int64_t NV = G->numVertices;
int64_t *color = G->marks;
*max = 0;
*maxV = 0;
cardinality = xmalloc(NV * sizeof(uint64_t));
OMP("omp parallel for")
for (i = 0; i < NV; i++) {
cardinality[i] = 0;
}
OMP("omp parallel for")
for (i = 0; i < NV; i++) {
// cardinality[color[i]]++;
stinger_int_fetch_add(&cardinality[color[i]], 1);
}
#ifdef __MTA__
for (i = 0; i < NV; i++) {
uint64_t degree = cardinality[i];
sum_sq += degree*degree;
sum += degree;
if (degree > *max) {
*max = degree;
}
}
#else
OMP("omp parallel")
{
int64_t myMaxDegree = 0;
OMP("omp for reduction(+:sum_sq) reduction(+:sum)")
for (i = 0; i < NV; i++) {
uint64_t degree = cardinality[i];
sum_sq += degree*degree;
sum += degree;
if (degree > myMaxDegree) {
myMaxDegree = degree;
}
}
if (myMaxDegree > *max)
{
OMP("omp critical")
{
if (myMaxDegree > *max) *max = myMaxDegree;
}
}
}
#endif
uint64_t max2 = 0;
int64_t checker = *max;
MTA("mta assert nodep")
for (i = 0; i < NV; i++)
{
uint64_t degree = cardinality[i];
uint64_t tmp = (checker == degree ? i : 0);
if(tmp > max2)
max2 = tmp;
}
*maxV = max2;
average = (double) sum / (double) numColors;
avg_sq = (double) sum_sq / (double) numColors;
variance = avg_sq - (average*average);
std_dev = sqrt(variance);
printf("Maximum # of vertices: %ld\n", *max);
printf("Average # of vertices: %f\n", average);
printf("Expected value of X^2: %f\n", avg_sq);
printf("Variance: %f\n", variance);
printf("Standard deviation: %f\n", std_dev);
free(cardinality);
}