-
Notifications
You must be signed in to change notification settings - Fork 1
/
bfs.hpp
519 lines (421 loc) · 15.9 KB
/
bfs.hpp
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
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
// Copyright (C) 2018 Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine.
// Boost Software License - Version 1.0 - August 17th, 2003
// Permission is hereby granted, free of charge, to any person or organization
// obtaining a copy of the software and accompanying documentation covered by
// this license (the "Software") to use, reproduce, display, distribute,
// execute, and transmit the Software, and to prepare derivative works of the
// Software, and to permit third-parties to whom the Software is furnished to
// do so, all subject to the following:
// The copyright notices in the Software and this entire statement, including
// the above license grant, this restriction and the following disclaimer,
// must be included in all copies of the Software, in whole or in part, and
// all derivative works of the Software, unless such copies or derivative
// works are solely in the form of machine-executable object code generated by
// a source language processor.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
// Authors: Thejaka Kanewala
// Andrew Lumsdaine
#ifndef __AGM_BFS_HPP
#define __AGM_BFS_HPP
#include <boost/config.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/agm/util/stat.hpp>
#include <boost/graph/agm/model/agm.hpp>
#include <boost/graph/agm/runtime/runtime.hpp>
#include <boost/graph/agm/model/general_orderings.hpp>
namespace boost { namespace graph { namespace agm {
// definition of the BFS work item set
typedef int Level;
template<typename Graph>
class bfs_family {
typedef typename boost::graph_traits < Graph >::vertex_descriptor Vertex;
// work item set definition
// Every work item must have the time
// destination, level
typedef std::tuple<Vertex, Level> WorkItem;
//===================================================================================
// Pair of processing functions : post order pf and pre-order pf
//===================================================================================
// the post-order processing function
template<typename State>
struct post_order_bfs_pf {
public:
post_order_bfs_pf(const Graph& _rg, State& _st, agm_work_stats& _sr) : g(_rg),
vlevel(_st),
stats(_sr){}
private:
const Graph& g;
State& vlevel;
agm_work_stats& stats;
public:
template<typename buckets>
void operator()(const WorkItem& wi,
int tid,
buckets& outset) {
Vertex v = std::get<0>(wi);
int level = std::get<1>(wi);
if (level == vlevel[v]) {
BGL_FORALL_OUTEDGES_T(v, e, g, Graph) {
Vertex u = boost::target(e, g);
#ifdef PBGL2_PRINT_WORK_STATS
stats.increment_edges(tid);
#endif
WorkItem generated(u, (level+1));
outset.push(generated, tid);
}
}
#ifdef PBGL2_PRINT_WORK_STATS
else {
stats.increment_invalidated_cancels(tid);
}
#endif
}
};
template<typename State>
struct preorder_bfs_pf {
public:
preorder_bfs_pf(const Graph& _rg,
State& _st,
agm_work_stats& _sr) : g(_rg),
vlevel(_st),
stats(_sr){}
private:
const Graph& g;
State& vlevel;
agm_work_stats& stats;
public:
template<typename buckets>
void operator()(const WorkItem& wi,
int tid,
buckets& outset) {
Vertex v = std::get<0>(wi);
int level = std::get<1>(wi);
int old_level = vlevel[v], last_old_level;
while(level < old_level) {
last_old_level = old_level;
old_level = boost::parallel::val_compare_and_swap(&vlevel[v], old_level, level);
if (last_old_level == old_level) {
#ifdef PBGL2_PRINT_WORK_STATS
if (old_level < INT_MAX) {
stats.increment_invalidated(tid);
} else
stats.increment_useful(tid);
#endif
outset.push(wi, tid);
return;
}
}
#ifdef PBGL2_PRINT_WORK_STATS
stats.increment_rejected(tid);
#endif
}
};
// the processing function
template<typename State>
struct bfs_pf {
public:
bfs_pf(const Graph& _rg, State& _st, agm_work_stats& _sr) : g(_rg),
vlevel(_st),
stats(_sr){}
private:
const Graph& g;
State& vlevel;
agm_work_stats& stats;
public:
template<typename buckets>
void operator()(const WorkItem& wi,
int tid,
buckets& outset) {
Vertex v = std::get<0>(wi);
int level = std::get<1>(wi);
int old_level = vlevel[v], last_old_level;
while(level < old_level) {
last_old_level = old_level;
old_level = boost::parallel::val_compare_and_swap(&vlevel[v], old_level, level);
if (last_old_level == old_level) {
#ifdef PBGL2_PRINT_WORK_STATS
if (old_level < INT_MAX) {
stats.increment_invalidated(tid);
} else
stats.increment_useful(tid);
#endif
BGL_FORALL_OUTEDGES_T(v, e, g, Graph) {
Vertex u = boost::target(e, g);
#ifdef PBGL2_PRINT_WORK_STATS
stats.increment_edges(tid);
#endif
WorkItem generated(u, (level+1));
outset.push(generated, tid);
}
return;
}
}
#ifdef PBGL2_PRINT_WORK_STATS
stats.increment_rejected(tid);
#endif
}
};
public:
template<typename DistMap>
bool verify(const Graph& g, Vertex s, DistMap& dists) {
dists.set_consistency_model(boost::parallel::cm_forward);
dists.set_max_ghost_cells(0);
if (g.transport().rank() == 0)
info("Verifying distances ....");
{
amplusplus::scoped_epoch epoch(g.transport());
BGL_FORALL_VERTICES_T(v, g, Graph) {
BGL_FORALL_OUTEDGES_T(v, e, g, Graph) {
boost::get(dists, target(e, g));
}
}
}
BGL_FORALL_VERTICES_T(v, g, Graph) {
BGL_FORALL_OUTEDGES_T(v, e, g, Graph) {
if (dists[source(e, g)] == INT_MAX) {
if (dists[target(e, g)] != INT_MAX) {
std::cout << "[ERROR] Source unvisited, therefore target must also be unvisited. But Target -- (" << target(e, g) << ", " << dists[target(e, g)] << ") -> Source -- ("
<< source(e, g) << ", " << dists[source(e, g)] << ") " << std::endl;
std::abort();
}
} else if (dists[target(e, g)] > (dists[source(e, g)] + 1)) {
std::cout << "[ERROR] Target distance is greater than source distance + 1: Target -- (" << target(e, g) << ", " << dists[target(e, g)] << ") -> Source -- ("
<< source(e, g) << ", " << dists[source(e, g)] << ") " << std::endl;
std::abort();
}
}
}
info("Verification successful ...");
return true;
}
private:
template<typename RuntimeModelGen,
typename EAGMConfig,
typename LevelState>
time_type execute_split_pf(const Graph& g,
RuntimeModelGen rtmodelgen,
EAGMConfig& config,
WorkItem sw,
LevelState vlevel,
instance_params& runtime_params,
agm_work_stats& sr,
bool _verify=true) {
// Initial work item set
typedef append_buffer<WorkItem, 10u> InitialWorkItems;
InitialWorkItems initial;
auto s = std::get<0>(sw);
if (get(get(vertex_owner, g), s) == _RANK) {
vlevel[s] = 0;
initial.push_back(sw);
#ifdef PBGL2_PRINT_WORK_STATS
sr.increment_useful(0);
#endif
}
typedef preorder_bfs_pf<LevelState> ProcessingFunction;
ProcessingFunction pf(g, vlevel, sr);
typedef post_order_bfs_pf<LevelState> PostOrderProcessingFunction;
PostOrderProcessingFunction sendpf(g, vlevel, sr);
// BFS algorithm
typedef eagm<Graph,
WorkItem,
ProcessingFunction,
EAGMConfig,
RuntimeModelGen,
PostOrderProcessingFunction> bfs_eagm_t;
bfs_eagm_t bfsalgo(rtmodelgen,
config,
pf,
sendpf,
initial);
info("Invoking BFS algorithm with split processing functions ...");
time_type elapsed = bfsalgo(runtime_params);
#ifdef PBGL2_PRINT_WORK_STATS
bfsalgo.print_stats();
#endif
return elapsed;
}
template<typename RuntimeModelGen,
typename EAGMConfig,
typename LevelState>
time_type execute_pre_order_pf(const Graph& g,
RuntimeModelGen rtmodelgen,
EAGMConfig& config,
WorkItem sw,
LevelState vlevel,
instance_params& runtime_params,
agm_work_stats& sr,
bool _verify=true) {
// Initial work item set
typedef append_buffer<WorkItem, 10u> InitialWorkItems;
InitialWorkItems initial;
auto s = std::get<0>(sw);
if (get(get(vertex_owner, g), s) == _RANK) {
initial.push_back(sw);
}
typedef bfs_pf<LevelState> ProcessingFunction;
ProcessingFunction pf(g, vlevel, sr);
// BFS algorithm
typedef eagm<Graph,
WorkItem,
ProcessingFunction,
EAGMConfig,
RuntimeModelGen,
EMPTY_PF> bfs_eagm_t;
bfs_eagm_t bfsalgo(rtmodelgen,
config,
pf,
initial);
info("Invoking BFS algorithm with pre-order processing function ...");
time_type elapsed = bfsalgo(runtime_params);
#ifdef PBGL2_PRINT_WORK_STATS
bfsalgo.print_stats();
#endif
return elapsed;
}
template<typename RuntimeModelGen,
typename EAGMConfig,
typename LevelState>
time_type execute_post_order_pf(const Graph& g,
RuntimeModelGen rtmodelgen,
EAGMConfig& config,
WorkItem sw,
LevelState vlevel,
instance_params& runtime_params,
agm_work_stats& sr,
bool _verify=true) {
// Initial work item set
typedef append_buffer<WorkItem, 10u> InitialWorkItems;
InitialWorkItems initial;
auto s = std::get<0>(sw);
if (get(get(vertex_owner, g), s) == _RANK) {
initial.push_back(sw);
}
typedef bfs_pf<LevelState> ProcessingFunction;
ProcessingFunction pf(g, vlevel, sr);
// BFS algorithm
typedef eagm<Graph,
WorkItem,
EMPTY_PF,
EAGMConfig,
RuntimeModelGen,
ProcessingFunction> bfs_eagm_t;
bfs_eagm_t bfsalgo(rtmodelgen,
config,
pf,
initial);
info("Invoking BFS algorithm with post-order processing function ...");
time_type elapsed = bfsalgo(runtime_params);
#ifdef PBGL2_PRINT_WORK_STATS
bfsalgo.print_stats();
#endif
return elapsed;
}
public:
template<typename RuntimeModelGen,
typename EAGMConfig,
typename agm_param_type>
time_type execute_eagm(const Graph& g,
RuntimeModelGen rtmodelgen,
EAGMConfig& config,
agm_param_type& agm_params,
Vertex source,
instance_params& runtime_params,
agm_work_stats& sr,
bool _verify=true) {
info("Creating the state ...");
// State
typedef typename boost::property_map<Graph, boost::vertex_index_t>::type VertexIndexMap;
std::vector<int> distmap(num_vertices(g), INT_MAX);
typedef boost::iterator_property_map<typename std::vector<int>::iterator, VertexIndexMap> DistMap;
DistMap distance_state(distmap.begin(), get(boost::vertex_index, g));
// source
WorkItem sw(source, 0);
info("Invoking BFS algorithm ...");
time_type elapsed = -1;
if (agm_params.pf_mode == agm_pf_splitted) {
elapsed = execute_split_pf(g,
rtmodelgen,
config,
sw,
distance_state,
runtime_params,
sr,
_verify);
} else if (agm_params.pf_mode == agm_pf_preorder) {
elapsed = execute_pre_order_pf(g,
rtmodelgen,
config,
sw,
distance_state,
runtime_params,
sr,
_verify);
} else if (agm_params.pf_mode == agm_pf_postorder) {
elapsed = execute_post_order_pf(g,
rtmodelgen,
config,
sw,
distance_state,
runtime_params,
sr,
_verify);
} else {
error("Invalid processing function invocation mode!");
assert(false);
}
if (_verify) {
verify(g, source, distance_state);
}
return elapsed;
}
template<typename RuntimeModelGen,
typename StrictWeakOrdering>
time_type execute(const Graph& g,
RuntimeModelGen rtmodelgen,
StrictWeakOrdering ordering,
instance_params& runtime_params,
agm_work_stats& sr,
bool _verify=true) {
info("Creating the state ...");
// State
typedef typename boost::property_map<Graph, boost::vertex_index_t>::type VertexIndexMap;
std::vector<int> distmap(num_vertices(g), INT_MAX);
typedef boost::iterator_property_map<typename std::vector<int>::iterator, VertexIndexMap> DistMap;
DistMap distance_state(distmap.begin(), get(boost::vertex_index, g));
// source
Vertex source = 2;
info("Setting the initial work item set ...");
// Initial work item set
std::vector<WorkItem> initial;
initial.push_back(WorkItem(source, 0));
info("Setting the processing function ...");
// Processing funcion
typedef bfs_pf<DistMap> ProcessingFunction;
ProcessingFunction pf(g, distance_state, sr);
// BFS algorithm
typedef agm<Graph,
WorkItem,
ProcessingFunction,
StrictWeakOrdering,
RuntimeModelGen> bfs_agm_t;
bfs_agm_t bfsalgo(pf,
ordering,
rtmodelgen);
info("Invoking BFS algorithm ...");
time_type elapsed = bfsalgo(initial, runtime_params);
if (_verify) {
verify(g, source, distance_state);
}
return elapsed;
}
};
}}}
#endif