-
Notifications
You must be signed in to change notification settings - Fork 2
/
pulp_data.cpp
219 lines (192 loc) · 8.13 KB
/
pulp_data.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
#include <mpi.h>
#include <omp.h>
#include <stdint.h>
#include <stdlib.h>
#include "pulp_data.h"
#include "util.h"
extern int procid, nprocs;
extern bool verbose, debug, verify;
void init_thread_pulp(thread_pulp_t* tp, pulp_data_t* pulp) {
// if (debug) printf("Task %d init_thread_pulp() start\n", procid);
tp->part_counts = (double*)malloc(pulp->num_parts * sizeof(double));
tp->part_weights = (double*)malloc(pulp->num_parts * sizeof(double));
tp->part_edge_weights = (double*)malloc(pulp->num_parts * sizeof(double));
tp->part_cut_weights = (double*)malloc(pulp->num_parts * sizeof(double));
// if (debug) printf("Task %d init_thread_pulp() success\n", procid);
}
void clear_thread_pulp(thread_pulp_t* tp) {
// if (debug) printf("Task %d clear_thread_pulp() start\n", procid);
free(tp->part_counts);
free(tp->part_weights);
free(tp->part_edge_weights);
free(tp->part_cut_weights);
// if (debug) printf("Task %d clear_thread_pulp() success\n", procid);
}
void init_pulp_data(dist_graph_t* g, pulp_data_t* pulp, int32_t num_parts) {
if (debug) printf("Task %d init_pulp_data() start\n", procid);
pulp->num_parts = num_parts;
if (g->edge_weights == NULL && g->vertex_weights == NULL)
pulp->avg_size = (double)g->n / (double)pulp->num_parts;
else
pulp->avg_size = (double)g->vertex_weights_sum / (double)pulp->num_parts;
pulp->avg_edge_size = (double)g->m * 2 / (double)pulp->num_parts;
pulp->avg_cut_size = 0.0;
pulp->max_v = 0.0;
pulp->max_e = 1.0;
pulp->max_c = 1.0;
pulp->weight_exponent_e = 1.0;
pulp->weight_exponent_c = 1.0;
pulp->running_max_v = 1.0;
pulp->running_max_e = 1.0;
pulp->running_max_c = 1.0;
pulp->local_parts = (int32_t*)malloc(g->n_total * sizeof(int32_t));
pulp->part_sizes = (int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
pulp->part_edge_sizes = (int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
pulp->part_cut_sizes = (int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
pulp->part_size_changes = (int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
pulp->part_edge_size_changes =
(int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
pulp->part_cut_size_changes =
(int64_t*)malloc(pulp->num_parts * sizeof(int64_t));
if (pulp->local_parts == NULL || pulp->part_sizes == NULL ||
pulp->part_edge_sizes == NULL || pulp->part_cut_sizes == NULL ||
pulp->part_size_changes == NULL || pulp->part_edge_size_changes == NULL ||
pulp->part_cut_size_changes == NULL)
throw_err("init_pulp_data(), unable to allocate resources", procid);
pulp->cut_size = 0;
pulp->max_cut = 0;
pulp->cut_size_change = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) pulp->part_sizes[p] = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) pulp->part_edge_sizes[p] = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) pulp->part_cut_sizes[p] = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) pulp->part_size_changes[p] = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p)
pulp->part_edge_size_changes[p] = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p)
pulp->part_cut_size_changes[p] = 0;
if (debug) printf("Task %d init_pulp_data() success\n", procid);
}
void update_pulp_data(dist_graph_t* g, pulp_data_t* pulp) {
for (int32_t p = 0; p < pulp->num_parts; ++p) {
pulp->part_sizes[p] = 0;
pulp->part_edge_sizes[p] = 0;
pulp->part_cut_sizes[p] = 0;
pulp->part_size_changes[p] = 0;
pulp->part_edge_size_changes[p] = 0;
pulp->part_cut_size_changes[p] = 0;
}
pulp->cut_size = 0;
for (uint64_t i = 0; i < g->n_local; ++i) {
uint64_t vert_index = i;
int32_t part = pulp->local_parts[vert_index];
++pulp->part_sizes[part];
uint64_t out_degree = out_degree(g, vert_index);
uint64_t* outs = out_vertices(g, vert_index);
pulp->part_edge_sizes[part] += (int64_t)out_degree;
for (uint64_t j = 0; j < out_degree; ++j) {
uint64_t out_index = outs[j];
int32_t part_out = pulp->local_parts[out_index];
if (part_out != part) {
++pulp->part_cut_sizes[part];
++pulp->cut_size;
}
}
}
MPI_Allreduce(MPI_IN_PLACE, pulp->part_sizes, pulp->num_parts, MPI_INT64_T,
MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, pulp->part_edge_sizes, pulp->num_parts,
MPI_INT64_T, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, pulp->part_cut_sizes, pulp->num_parts,
MPI_INT64_T, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, &pulp->cut_size, 1, MPI_INT64_T, MPI_SUM,
MPI_COMM_WORLD);
pulp->cut_size /= 2;
pulp->avg_cut_size = (double)pulp->cut_size / (double)pulp->num_parts;
pulp->max_v = 0;
pulp->max_e = 0;
pulp->max_c = 0;
pulp->max_cut = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) {
if ((double)pulp->part_sizes[p] / pulp->avg_size > pulp->max_v)
pulp->max_v = (double)pulp->part_sizes[p] / pulp->avg_size;
if ((double)pulp->part_edge_sizes[p] / pulp->avg_edge_size > pulp->max_e)
pulp->max_e = (double)pulp->part_edge_sizes[p] / pulp->avg_edge_size;
if ((double)pulp->part_cut_sizes[p] / pulp->avg_cut_size > pulp->max_c)
pulp->max_c = (double)pulp->part_cut_sizes[p] / pulp->avg_cut_size;
if (pulp->part_cut_sizes[p] > pulp->max_cut)
pulp->max_cut = pulp->part_cut_sizes[p];
}
}
void update_pulp_data_weighted(dist_graph_t* g, pulp_data_t* pulp) {
bool has_vwgts = (g->vertex_weights != NULL);
bool has_ewgts = (g->edge_weights != NULL);
for (int32_t p = 0; p < pulp->num_parts; ++p) {
pulp->part_sizes[p] = 0;
pulp->part_edge_sizes[p] = 0;
pulp->part_cut_sizes[p] = 0;
pulp->part_size_changes[p] = 0;
pulp->part_edge_size_changes[p] = 0;
pulp->part_cut_size_changes[p] = 0;
}
pulp->cut_size = 0;
for (uint64_t i = 0; i < g->n_local; ++i) {
uint64_t vert_index = i;
int32_t part = pulp->local_parts[vert_index];
if (has_vwgts)
pulp->part_sizes[part] += g->vertex_weights[vert_index];
else
++pulp->part_sizes[part];
uint64_t out_degree = out_degree(g, vert_index);
uint64_t* outs = out_vertices(g, vert_index);
int32_t* weights = out_weights(g, vert_index);
pulp->part_edge_sizes[part] += (int64_t)out_degree;
for (uint64_t j = 0; j < out_degree; ++j) {
uint64_t out_index = outs[j];
int32_t part_out = pulp->local_parts[out_index];
if (part_out != part) {
if (has_ewgts) {
pulp->part_cut_sizes[part] += weights[j];
pulp->cut_size += weights[j];
} else {
++pulp->part_cut_sizes[part];
++pulp->cut_size;
}
}
}
}
MPI_Allreduce(MPI_IN_PLACE, pulp->part_sizes, pulp->num_parts, MPI_INT64_T,
MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, pulp->part_edge_sizes, pulp->num_parts,
MPI_INT64_T, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, pulp->part_cut_sizes, pulp->num_parts,
MPI_INT64_T, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(MPI_IN_PLACE, &pulp->cut_size, 1, MPI_INT64_T, MPI_SUM,
MPI_COMM_WORLD);
pulp->cut_size /= 2;
pulp->avg_cut_size = (double)pulp->cut_size / (double)pulp->num_parts;
pulp->max_v = 0;
pulp->max_e = 0;
pulp->max_c = 0;
pulp->max_cut = 0;
for (int32_t p = 0; p < pulp->num_parts; ++p) {
if ((double)pulp->part_sizes[p] / pulp->avg_size > pulp->max_v)
pulp->max_v = (double)pulp->part_sizes[p] / pulp->avg_size;
if ((double)pulp->part_edge_sizes[p] / pulp->avg_edge_size > pulp->max_e)
pulp->max_e = (double)pulp->part_edge_sizes[p] / pulp->avg_edge_size;
if ((double)pulp->part_cut_sizes[p] / pulp->avg_cut_size > pulp->max_c)
pulp->max_c = (double)pulp->part_cut_sizes[p] / pulp->avg_cut_size;
if (pulp->part_cut_sizes[p] > pulp->max_cut)
pulp->max_cut = pulp->part_cut_sizes[p];
}
}
void clear_pulp_data(pulp_data_t* pulp) {
if (debug) printf("Task %d clear_pulp_data() start\n", procid);
free(pulp->local_parts);
free(pulp->part_sizes);
free(pulp->part_edge_sizes);
free(pulp->part_cut_sizes);
free(pulp->part_size_changes);
free(pulp->part_edge_size_changes);
free(pulp->part_cut_size_changes);
if (debug) printf("Task %d clear_pulp_data() success\n", procid);
}