-
Notifications
You must be signed in to change notification settings - Fork 3
/
main_lfr.cpp
275 lines (218 loc) · 9.24 KB
/
main_lfr.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
#include <iostream>
#include <chrono>
#include <stxxl/cmdline>
#include <defs.h>
#include <Utils/MonotonicPowerlawRandomStream.h>
#include <LFR/LFR.h>
#include <LFR/LFRCommunityAssignBenchmark.h>
#include <Utils/ExportGraph.h>
enum OutputFileType {
METIS,
THRILLBIN,
EDGELIST,
SNAP
};
#include <Utils/RandomSeed.h>
class RunConfig {
void _update_structs() {
node_distribution_param.exponent = node_gamma;
assert(node_gamma < 0);
node_distribution_param.minDegree = node_min_degree;
node_distribution_param.maxDegree = node_max_degree;
node_distribution_param.numberOfNodes = number_of_nodes;
node_distribution_param.scale = 1.0;
community_distribution_param.exponent = community_gamma;
assert(community_gamma < 0);
community_distribution_param.minDegree = community_min_members;
community_distribution_param.maxDegree = community_max_members;
community_distribution_param.numberOfNodes = number_of_communities;
community_distribution_param.scale = 1.0;
}
public:
stxxl::uint64 number_of_nodes;
stxxl::uint64 number_of_communities;
stxxl::uint64 node_min_degree;
stxxl::uint64 node_max_degree;
stxxl::uint64 max_degree_within_community;
double node_gamma;
stxxl::uint64 overlap_degree;
stxxl::uint64 overlapping_nodes;
stxxl::uint64 community_min_members;
stxxl::uint64 community_max_members;
double community_gamma;
double mixing;
stxxl::uint64 max_bytes;
unsigned int randomSeed;
std::string output_filename, partition_filename;
std::string output_filetype;
OutputFileType outputFileType = METIS;
MonotonicPowerlawRandomStream<false>::Parameters node_distribution_param;
MonotonicPowerlawRandomStream<false>::Parameters community_distribution_param;
unsigned int lfr_bench_rounds;
bool lfr_bench_comassign;
bool lfr_bench_comassign_retry;
double community_rewiring_random = 1.0;
RunConfig() :
number_of_nodes (100000),
number_of_communities( 10000),
node_min_degree(10),
node_max_degree(number_of_nodes / 10),
max_degree_within_community(node_max_degree),
node_gamma(-2.0),
overlap_degree(0),
overlapping_nodes(0),
community_min_members( 25),
community_max_members(1000),
community_gamma(-1.0),
mixing(0.5),
max_bytes(10 * UIntScale::Gi),
lfr_bench_rounds(100),
lfr_bench_comassign(false),
lfr_bench_comassign_retry(false)
{
using myclock = std::chrono::high_resolution_clock;
myclock::duration d = myclock::now() - myclock::time_point::min();
randomSeed = d.count();
_update_structs();
}
#if STXXL_VERSION_INTEGER > 10401
#define CMDLINE_COMP(chr, str, dest, args...) \
chr, str, dest, args
#else
#define CMDLINE_COMP(chr, str, dest, args...) \
chr, str, args, dest
#endif
bool parse_cmdline(int argc, char* argv[]) {
stxxl::cmdline_parser cp;
cp.add_bytes (CMDLINE_COMP('n', "num-nodes", number_of_nodes, "Number of nodes"));
cp.add_bytes (CMDLINE_COMP('c', "num-communities", number_of_communities, "Number of communities"));
cp.add_bytes (CMDLINE_COMP('i', "node-min-degree", node_min_degree, "Minumum node degree"));
cp.add_bytes (CMDLINE_COMP('a', "node-max-degree", node_max_degree, "Maximum node degree"));
cp.add_double(CMDLINE_COMP('j', "node-gamma", node_gamma, "Exponent of node degree distribution"));
cp.add_bytes (CMDLINE_COMP('x', "community-min-members", community_min_members, "Minumum community size"));
cp.add_bytes (CMDLINE_COMP('y', "community-max-members", community_max_members, "Maximum community size"));
cp.add_double(CMDLINE_COMP('z', "community-gamma", community_gamma, "Exponent of community size distribution"));
cp.add_double(CMDLINE_COMP('r', "community-rewiring-random", community_rewiring_random, "Fraction of addition random swaps to duplicate swaps"));
cp.add_uint (CMDLINE_COMP('s', "seed", randomSeed, "Initial seed for PRNG"));
cp.add_bytes (CMDLINE_COMP('l', "num-overlap-node", overlapping_nodes, "Minumum node degree"));
cp.add_bytes (CMDLINE_COMP('k', "overlap-members", overlap_degree, "Maximum node degree"));
cp.add_double(CMDLINE_COMP('m', "mixing", mixing, "Fraction node edge being inter-community"));
cp.add_bytes(CMDLINE_COMP('b', "max-bytes", max_bytes, "Maximum number of bytes of main memory to use"));
cp.add_string(CMDLINE_COMP('o', "output", output_filename, "Output filename; the generated graph will be written as METIS graph"));
cp.add_string(CMDLINE_COMP('p', "partition-output", partition_filename, "Partition output filename; every line contains a node and the communities of the node separated by spaces"));
cp.add_uint(CMDLINE_COMP('d', "lfr-bench-rounds", lfr_bench_rounds, "# of rounds for LFR benchmarks"));
cp.add_flag(CMDLINE_COMP('e', "lfr-comassign", lfr_bench_comassign, "Perform LFR comassign benchmark"));
cp.add_flag(CMDLINE_COMP('f', "lfr-comassign-retry", lfr_bench_comassign_retry, "Perform LFR comassign retry benchmark"));
cp.add_string(CMDLINE_COMP('t', "output-filetype", output_filetype, "Output filetype; METIS, THRILLBIN, ..."));
assert(number_of_communities < std::numeric_limits<community_t>::max());
if (!cp.process(argc, argv)) {
return false;
}
if (overlapping_nodes> number_of_nodes) {
std::cerr << "Number of overlapping exceed total number of nodes" << std::endl;
return false;
}
// select output filetype
{
std::transform(output_filetype.begin(), output_filetype.end(), output_filetype.begin(), ::toupper);
if (output_filetype.empty() ||
0 == output_filetype.compare("METIS")) { outputFileType = METIS; }
else if (0 == output_filetype.compare("THRILLBIN")) { outputFileType = THRILLBIN; }
else if (0 == output_filetype.compare("EDGELIST")) { outputFileType = EDGELIST; }
else if (0 == output_filetype.compare("SNAP")) { outputFileType = SNAP; }
else {
std::cerr << "Invalid or no output file type specified, using default ThrillBin file type" << std::endl;
cp.print_usage();
return false;
}
std::cout << "Using filetype: " << output_filetype << std::endl;
}
// set community and node gamma to corresponding negative value
if (community_gamma > 0)
community_gamma = (-1.0) * community_gamma;
if (node_gamma > 0)
node_gamma = (-1.0) * node_gamma;
if (community_rewiring_random < 0) {
std::cerr << "community-rewiring-random has to be non-negative" << std::endl;
return false;
}
if (community_gamma > -1.0) {
std::cerr << "community-gamma has to be at least 1" << std::endl;
return false;
}
if (node_gamma > -1.0) {
std::cerr << "node-gamma has to be at least 1" << std::endl;
return false;
}
cp.print_result();
_update_structs();
return true;
}
};
int main(int argc, char* argv[]) {
#ifndef NDEBUG
std::cout << "[build with assertions]" << std::endl;
#endif
// output argument string
for(int i=0; i < argc; i++)
std::cout << argv[i] << " ";
std::cout << std::endl;
omp_set_nested(1);
//omp_set_num_threads(1);
RunConfig config;
if (!config.parse_cmdline(argc, argv))
return -1;
stxxl::srandom_number32(config.randomSeed);
stxxl::set_seed(config.randomSeed);
RandomSeed::get_instance().seed(config.randomSeed);
LFR::LFR lfr(config.node_distribution_param,
config.community_distribution_param,
config.mixing,
config.max_bytes);
LFR::OverlapConfig oconfig;
oconfig.constDegree.multiCommunityDegree = config.overlap_degree;
oconfig.constDegree.overlappingNodes = config.overlapping_nodes;
lfr.setOverlap(LFR::OverlapMethod::constDegree, oconfig);
lfr.setCommunityRewiringRandom(config.community_rewiring_random);
if (config.lfr_bench_comassign) {
LFR::LFRCommunityAssignBenchmark bench(lfr);
bench.computeDistribution(config.lfr_bench_rounds);
} else if(config.lfr_bench_comassign_retry) {
LFR::LFRCommunityAssignBenchmark bench(lfr);
bench.computeRetryRate(config.lfr_bench_rounds);
} else {
lfr.run();
if (!config.output_filename.empty()) {
lfr.get_edges().rewind();
// Output to file
if (!config.output_filename.empty()) {
switch (config.outputFileType) {
case METIS:
export_as_metis_sorted(lfr.get_edges(), config.output_filename);
break;
case THRILLBIN:
export_as_thrillbin_sorted(lfr.get_edges(), config.output_filename, config.node_distribution_param.numberOfNodes);
break;
case EDGELIST:
export_as_edgelist(lfr.get_edges(), config.output_filename);
break;
case SNAP:
export_as_snap(lfr.get_edges(), config.node_distribution_param.numberOfNodes, config.output_filename);
}
}
}
if (!config.partition_filename.empty()) {
if (config.outputFileType == THRILLBIN) {
std::ofstream output_stream(config.partition_filename, std::ios::trunc | std::ios::binary);
lfr.export_community_assignment_binary(output_stream);
output_stream.close();
} else {
std::ofstream output_stream(config.partition_filename, std::ios::trunc);
lfr.export_community_assignment(output_stream);
output_stream.close();
}
}
}
std::cout << "Maximum EM allocation: " << stxxl::block_manager::get_instance()->get_maximum_allocation() << std::endl;
return 0;
}