-
Notifications
You must be signed in to change notification settings - Fork 1
/
dspl.hpp
1810 lines (1553 loc) · 55.6 KB
/
dspl.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
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// ***********************************************************************
//
// miniVite
//
// ***********************************************************************
//
// Copyright (2018) Battelle Memorial Institute
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the copyright holder nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
// COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// ************************************************************************
#pragma once
#ifndef DSPL_HPP
#define DSPL_HPP
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <utility>
#include <mpi.h>
#include <omp.h>
#include "graph.hpp"
#include "utils.hpp"
struct Comm {
GraphElem size;
GraphWeight degree;
Comm() : size(0), degree(0.0) {};
};
struct CommInfo {
GraphElem community;
GraphElem size;
GraphWeight degree;
};
const int SizeTag = 1;
const int VertexTag = 2;
const int CommunityTag = 3;
const int CommunitySizeTag = 4;
const int CommunityDataTag = 5;
// print edge stat on each iteration
// uncomment this line to enable
#undef EDGE_STAT
#ifdef EDGE_STAT
enum EdgeCase {
EDGE_CASE_SAME_COMMUNITY,
EDGE_CASE_HIGH_DEGREE,
EDGE_CASE_LOW_DEGREE,
EDGE_CASE_NUM
};
unsigned long casesCounter[EDGE_CASE_NUM];
#endif
static MPI_Datatype commType;
void distSumVertexDegree(const Graph &g, std::vector<GraphWeight> &vDegree, std::vector<Comm> &localCinfo)
{
const GraphElem nv = g.get_lnv();
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp parallel for default(shared), shared(g, vDegree, localCinfo), schedule(runtime)
#else
#pragma omp parallel for default(shared), shared(g, vDegree, localCinfo), schedule(guided)
#endif
for (GraphElem i = 0; i < nv; i++) {
GraphElem e0, e1;
GraphWeight tw = 0.0;
g.edge_range(i, e0, e1);
for (GraphElem k = e0; k < e1; k++) {
const Edge &edge = g.get_edge(k);
tw += edge.weight_;
}
vDegree[i] = tw;
localCinfo[i].degree = tw;
localCinfo[i].size = 1L;
}
} // distSumVertexDegree
GraphWeight distCalcConstantForSecondTerm(const std::vector<GraphWeight> &vDegree, MPI_Comm gcomm)
{
GraphWeight totalEdgeWeightTwice = 0.0;
GraphWeight localWeight = 0.0;
int me = -1;
const size_t vsz = vDegree.size();
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp parallel for default(shared), shared(vDegree), reduction(+: localWeight) schedule(runtime)
#else
#pragma omp parallel for default(shared), shared(vDegree), reduction(+: localWeight) schedule(static)
#endif
for (GraphElem i = 0; i < vsz; i++)
localWeight += vDegree[i]; // Local reduction
// Global reduction
MPI_Allreduce(&localWeight, &totalEdgeWeightTwice, 1,
MPI_WEIGHT_TYPE, MPI_SUM, gcomm);
return (1.0 / static_cast<GraphWeight>(totalEdgeWeightTwice));
} // distCalcConstantForSecondTerm
void distInitComm(std::vector<GraphElem> &pastComm, std::vector<GraphElem> &currComm, const GraphElem base)
{
const size_t csz = currComm.size();
#ifdef DEBUG_PRINTF
assert(csz == pastComm.size());
#endif
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp parallel for default(shared), shared(pastComm, currComm), firstprivate(base), schedule(runtime)
#else
#pragma omp parallel for default(shared), shared(pastComm, currComm), firstprivate(base), schedule(static)
#endif
for (GraphElem i = 0L; i < csz; i++) {
pastComm[i] = i + base;
currComm[i] = i + base;
}
} // distInitComm
void distInitLouvain(const Graph &dg, std::vector<GraphElem> &pastComm,
std::vector<GraphElem> &currComm, std::vector<GraphWeight> &vDegree,
std::vector<GraphWeight> &clusterWeight, std::vector<Comm> &localCinfo,
std::vector<Comm> &localCupdate, GraphWeight &constantForSecondTerm,
const int me)
{
const GraphElem base = dg.get_base(me);
const GraphElem nv = dg.get_lnv();
MPI_Comm gcomm = dg.get_comm();
vDegree.resize(nv);
pastComm.resize(nv);
currComm.resize(nv);
clusterWeight.resize(nv);
localCinfo.resize(nv);
localCupdate.resize(nv);
distSumVertexDegree(dg, vDegree, localCinfo);
constantForSecondTerm = distCalcConstantForSecondTerm(vDegree, gcomm);
distInitComm(pastComm, currComm, base);
} // distInitLouvain
// OPTIMIZATION:
// counter array is merged into clmap
// ccVal refers to counter[0] in original code
GraphElem distGetMaxIndex(const std::unordered_map<GraphElem, GraphWeight> &clmap,
const GraphWeight selfLoop, const std::vector<Comm> &localCinfo,
const std::map<GraphElem,Comm> &remoteCinfo, const GraphWeight vDegree,
const GraphElem currSize, const GraphWeight currDegree, const GraphElem currComm,
const GraphElem base, const GraphElem bound, const GraphWeight constant, const GraphWeight ccVal)
{
GraphElem maxIndex = currComm;
GraphWeight curGain = 0.0, maxGain = 0.0;
GraphWeight eix = static_cast<GraphWeight>(ccVal) - static_cast<GraphWeight>(selfLoop);
GraphWeight ax = currDegree - vDegree;
GraphWeight eiy = 0.0, ay = 0.0;
GraphElem maxSize = currSize;
GraphElem size = 0;
// NOTE:
// rewrite in c++ 17
// storedAlready is rewritten to for-each statement
for (auto [tcomm, tweight] : clmap) {
// NOTE:
// currComm != tcomm is always true
// because this case is handled in distBuildLocalMapCounter
// is_local, direct access local info
if ((tcomm >= base) && (tcomm < bound)) {
ay = localCinfo[tcomm - base].degree;
size = localCinfo[tcomm - base].size;
}
else {
// is_remote, lookup map
std::map<GraphElem,Comm>::const_iterator citer = remoteCinfo.find(tcomm);
ay = citer->second.degree;
size = citer->second.size;
}
// NOTE:
// counter is merged into clmap
// so counter[storedAlready->second] is tweight
eiy = tweight;
curGain = 2.0 * (eiy - eix) - 2.0 * vDegree * (ay - ax) * constant;
if ((curGain > maxGain) ||
((curGain == maxGain) && (curGain != 0.0) && (tcomm < maxIndex))) {
maxGain = curGain;
maxIndex = tcomm;
maxSize = size;
}
}
if ((maxSize == 1) && (currSize == 1) && (maxIndex > currComm))
maxIndex = currComm;
return maxIndex;
} // distGetMaxIndex
// OPTIMIZATION:
// counter array is merged into clmap
// ccVal is written into
GraphWeight distBuildLocalMapCounter(const GraphElem e0, const GraphElem e1, std::unordered_map<GraphElem, GraphWeight> &clmap,
const Graph &g,
const std::vector<GraphElem> &currComm,
const std::unordered_map<GraphElem, GraphElem> &remoteComm,
const GraphElem vertex, const GraphElem base, const GraphElem bound, const GraphElem cc, GraphWeight &ccVal)
{
// NOTE:
// numUniqueClusters is unused
GraphWeight selfLoop = 0;
std::unordered_map<GraphElem, GraphWeight>::iterator storedAlready;
for (GraphElem j = e0; j < e1; j++) {
const Edge &edge = g.get_edge(j);
const GraphElem &tail_ = edge.tail_;
const GraphWeight &weight = edge.weight_;
GraphElem tcomm;
if (tail_ == vertex + base)
selfLoop += weight;
// is_local, direct access local std::vector<GraphElem>
if ((tail_ >= base) && (tail_ < bound))
tcomm = currComm[tail_ - base];
else { // is_remote, lookup map
std::unordered_map<GraphElem, GraphElem>::const_iterator iter = remoteComm.find(tail_);
#ifdef DEBUG_PRINTF
assert(iter != remoteComm.end());
#endif
tcomm = iter->second;
}
// NOTE:
// when tcomm == cc, handle it directly
if (tcomm == cc) {
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_SAME_COMMUNITY]++;
#endif
ccVal += weight;
continue;
}
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_HIGH_DEGREE]++;
#endif
storedAlready = clmap.find(tcomm);
// NOTE:
// clmap and counter are merged
// so `counter[storedAlready->second]` is `storedAlready->second`
if (storedAlready != clmap.end())
storedAlready->second += weight;
else
clmap.insert(std::unordered_map<GraphElem, GraphWeight>::value_type(
tcomm, weight));
}
return selfLoop;
} // distBuildLocalMapCounter
// OPTIMIZATION:
// Sort based optimization of `distGetMaxIndex`
// `clmap` should be a sorted list of [tcomm, tweight]
GraphElem distGetMaxIndexSort(
const std::vector<std::pair<GraphElem, GraphWeight>> &clmap,
const GraphWeight selfLoop, const std::vector<Comm> &localCinfo,
const std::map<GraphElem, Comm> &remoteCinfo, const GraphWeight vDegree,
const GraphElem currSize, const GraphWeight currDegree,
const GraphElem currComm, const GraphElem base, const GraphElem bound,
const GraphWeight constant, const GraphWeight ccVal) {
// NOTE:
// do nothing when clmap is empty
// there is no other community connected
if (clmap.empty())
return currComm;
GraphElem maxIndex = currComm;
GraphWeight curGain = 0.0, maxGain = 0.0;
GraphWeight eix =
static_cast<GraphWeight>(ccVal) - static_cast<GraphWeight>(selfLoop);
GraphWeight ax = currDegree - vDegree;
GraphWeight eiy = 0.0, ay = 0.0;
GraphElem maxSize = currSize;
GraphElem size = 0;
// NOTE:
// rewrite using c++17
// after sorted, we can merge weights of
// consecutive elements with the same tcomm
// here we take the first element
auto [tcomm, tweight] = clmap[0];
// update max index using current tcomm and tweight
auto update = [&]() {
// is_local, direct access local info
if ((tcomm >= base) && (tcomm < bound)) {
ay = localCinfo[tcomm - base].degree;
size = localCinfo[tcomm - base].size;
} else {
// is_remote, lookup map
std::map<GraphElem, Comm>::const_iterator citer = remoteCinfo.find(tcomm);
ay = citer->second.degree;
size = citer->second.size;
}
eiy = tweight;
curGain = 2.0 * (eiy - eix) - 2.0 * vDegree * (ay - ax) * constant;
if ((curGain > maxGain) ||
((curGain == maxGain) && (curGain != 0.0) && (tcomm < maxIndex))) {
maxGain = curGain;
maxIndex = tcomm;
maxSize = size;
}
};
// NOTE:
// scan from second element(index=1)
for (int i = 1; i < clmap.size(); ++i) {
auto [scanningComm, scanningWeight] = clmap[i];
// when scanningComm differs from previous one, call update()
if (scanningComm != tcomm) {
update();
tcomm = scanningComm;
tweight = scanningWeight;
} else {
// and sum up weights when tcomm remains unchanged
tweight += scanningWeight;
}
}
// handle the remaining elements
update();
if ((maxSize == 1) && (currSize == 1) && (maxIndex > currComm))
maxIndex = currComm;
return maxIndex;
} // distGetMaxIndex
// OPTIMIZATION:
// Sort based optimization of `distBuildLocalMapCounter`
GraphWeight distBuildLocalMapCounterSort(
const GraphElem e0, const GraphElem e1,
std::vector<std::pair<GraphElem, GraphWeight>> &clmap, const Graph &g,
const std::vector<GraphElem> &currComm,
const std::unordered_map<GraphElem, GraphElem> &remoteComm,
const GraphElem vertex, const GraphElem base, const GraphElem bound,
const GraphElem cc, GraphWeight &ccVal) {
GraphWeight selfLoop = 0;
for (GraphElem j = e0; j < e1; j++) {
const Edge &edge = g.get_edge(j);
const GraphElem &tail_ = edge.tail_;
const GraphWeight &weight = edge.weight_;
GraphElem tcomm;
if (tail_ == vertex + base)
selfLoop += weight;
// is_local, direct access local std::vector<GraphElem>
if ((tail_ >= base) && (tail_ < bound))
tcomm = currComm[tail_ - base];
else { // is_remote, lookup map
std::unordered_map<GraphElem, GraphElem>::const_iterator iter =
remoteComm.find(tail_);
#ifdef DEBUG_PRINTF
assert(iter != remoteComm.end());
#endif
tcomm = iter->second;
}
if (tcomm == cc) {
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_SAME_COMMUNITY]++;
#endif
ccVal += weight;
continue;
}
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_HIGH_DEGREE]++;
#endif
// NOTE:
// we don't dedup elements by tcomm
// leave it for sorting
clmap.emplace_back(tcomm, weight);
}
// NOTE:
// actual sort after constructing `clmap`
std::sort(clmap.begin(), clmap.end(),
[](const auto &a, const auto &b) { return a.first < b.first; });
return selfLoop;
} // distBuildLocalMapCounter
// OPTIMIZATION:
// An on-stack implementation to replace hashmap
// implement the partial interface of std::unordered_map
template <typename K, typename V, int N, int R = 1> struct fakemap {
static constexpr int radix = R;
std::array<std::array<std::pair<K, V>, N>, R> storage;
std::array<int, R> length = {};
std::pair<K, V> *find(const K &k) {
int b = k % R;
for (int i = 0; i < length[b]; ++i)
if (storage[b][i].first == k)
return &storage[b][i];
return nullptr;
}
void emplace(const K &k, const V &v) {
int b = k % R;
storage[b][length[b]++] = {k, v};
}
};
template <int N, int R>
GraphElem distGetMaxIndexSmall(
const fakemap<GraphElem, GraphWeight, N, R> &clmap,
const GraphWeight selfLoop, const std::vector<Comm> &localCinfo,
const std::map<GraphElem, Comm> &remoteCinfo, const GraphWeight vDegree,
const GraphElem currSize, const GraphWeight currDegree,
const GraphElem currComm, const GraphElem base, const GraphElem bound,
const GraphWeight constant, const GraphWeight ccVal) {
GraphElem maxIndex = currComm;
GraphWeight curGain = 0.0, maxGain = 0.0;
GraphWeight eix =
static_cast<GraphWeight>(ccVal) - static_cast<GraphWeight>(selfLoop);
GraphWeight ax = currDegree - vDegree;
GraphWeight eiy = 0.0, ay = 0.0;
GraphElem maxSize = currSize;
GraphElem size = 0;
// NOTE:
// there are `R` buckets in the fakemap
for (int i = 0; i < R; ++i)
for (int j = 0; j < clmap.length[i]; ++j) {
auto [tcomm, tweight] = clmap.storage[i][j];
// is_local, direct access local info
if ((tcomm >= base) && (tcomm < bound)) {
ay = localCinfo[tcomm - base].degree;
size = localCinfo[tcomm - base].size;
} else {
// is_remote, lookup map
std::map<GraphElem, Comm>::const_iterator citer =
remoteCinfo.find(tcomm);
ay = citer->second.degree;
size = citer->second.size;
}
eiy = tweight;
curGain = 2.0 * (eiy - eix) - 2.0 * vDegree * (ay - ax) * constant;
if ((curGain > maxGain) ||
((curGain == maxGain) && (curGain != 0.0) && (tcomm < maxIndex))) {
maxGain = curGain;
maxIndex = tcomm;
maxSize = size;
}
}
if ((maxSize == 1) && (currSize == 1) && (maxIndex > currComm))
maxIndex = currComm;
return maxIndex;
} // distGetMaxIndex
// OPTIMIZATION:
// Small numbers optimization of `distBuildLocalMapCounter`
// Use `fakemap` instead of `unordered_map` for `clmap`
template <int N, int R>
GraphWeight distBuildLocalMapCounterSmall(
const GraphElem e0, const GraphElem e1,
fakemap<GraphElem, GraphWeight, N, R> &clmap, const Graph &g,
const std::vector<GraphElem> &currComm,
const std::unordered_map<GraphElem, GraphElem> &remoteComm,
const GraphElem vertex, const GraphElem base, const GraphElem bound,
const GraphElem cc, GraphWeight &ccVal) {
GraphWeight selfLoop = 0;
for (GraphElem j = e0; j < e1; j++) {
const Edge &edge = g.get_edge(j);
const GraphElem &tail_ = edge.tail_;
const GraphWeight &weight = edge.weight_;
GraphElem tcomm;
if (tail_ == vertex + base)
selfLoop += weight;
// is_local, direct access local std::vector<GraphElem>
if ((tail_ >= base) && (tail_ < bound))
tcomm = currComm[tail_ - base];
else { // is_remote, lookup map
std::unordered_map<GraphElem, GraphElem>::const_iterator iter =
remoteComm.find(tail_);
#ifdef DEBUG_PRINTF
assert(iter != remoteComm.end());
#endif
tcomm = iter->second;
}
if (tcomm == cc) {
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_SAME_COMMUNITY]++;
#endif
ccVal += weight;
continue;
}
#ifdef EDGE_STAT
#pragma omp atomic update
casesCounter[EDGE_CASE_LOW_DEGREE]++;
#endif
auto storedAlready = clmap.find(tcomm);
if (storedAlready)
storedAlready->second += weight;
else
clmap.emplace(tcomm, weight);
}
return selfLoop;
} // distBuildLocalMapCounter
// NOTE:
// Some thresholds for different optimizations
#ifndef SCC_SMALL_THRESHOLD_0
#define SCC_SMALL_THRESHOLD_0 20
#define SCC_SMALL_RADIX_0 1
#endif
#ifndef SCC_SMALL_THRESHOLD_1
#define SCC_SMALL_THRESHOLD_1 20
#define SCC_SMALL_RADIX_1 4
#endif
#ifndef SCC_SORT_THRESHOLD
#define SCC_SORT_THRESHOLD INT64_MAX
#endif
void distExecuteLouvainIteration(const GraphElem i, const Graph &dg, const std::vector<GraphElem> &currComm,
std::vector<GraphElem> &targetComm, const std::vector<GraphWeight> &vDegree,
std::vector<Comm> &localCinfo, std::vector<Comm> &localCupdate,
const std::unordered_map<GraphElem, GraphElem> &remoteComm,
const std::map<GraphElem,Comm> &remoteCinfo,
std::map<GraphElem,Comm> &remoteCupdate, const GraphWeight constantForSecondTerm,
std::vector<GraphWeight> &clusterWeight, const int me)
{
GraphElem localTarget = -1;
GraphElem e0, e1, selfLoop = 0;
const GraphElem base = dg.get_base(me), bound = dg.get_bound(me);
const GraphElem cc = currComm[i];
GraphWeight ccDegree;
GraphElem ccSize;
bool currCommIsLocal = false;
bool targetCommIsLocal = false;
// Current Community is local
if (cc >= base && cc < bound) {
ccDegree=localCinfo[cc-base].degree;
ccSize=localCinfo[cc-base].size;
currCommIsLocal=true;
} else {
// is remote
std::map<GraphElem,Comm>::const_iterator citer = remoteCinfo.find(cc);
ccDegree = citer->second.degree;
ccSize = citer->second.size;
currCommIsLocal=false;
}
dg.edge_range(i, e0, e1);
if (e0 != e1) {
// OPTIMIZATION:
// Use different optimization strategies based on `e1 - e0`
// Thresholds are configurable via macros
GraphWeight ccVal = 0;
if (e1 - e0 < SCC_SMALL_THRESHOLD_0) {
fakemap<GraphElem, GraphWeight, SCC_SMALL_THRESHOLD_0, SCC_SMALL_RADIX_0>
clmap;
selfLoop = distBuildLocalMapCounterSmall<SCC_SMALL_THRESHOLD_0,
SCC_SMALL_RADIX_0>(
e0, e1, clmap, dg, currComm, remoteComm, i, base, bound, cc, ccVal);
clusterWeight[i] += ccVal;
localTarget =
distGetMaxIndexSmall<SCC_SMALL_THRESHOLD_0, SCC_SMALL_RADIX_0>(
clmap, selfLoop, localCinfo, remoteCinfo, vDegree[i], ccSize,
ccDegree, cc, base, bound, constantForSecondTerm, ccVal);
} else if (e1 - e0 < SCC_SMALL_THRESHOLD_1) {
fakemap<GraphElem, GraphWeight, SCC_SMALL_THRESHOLD_1, SCC_SMALL_RADIX_1>
clmap;
selfLoop = distBuildLocalMapCounterSmall<SCC_SMALL_THRESHOLD_1,
SCC_SMALL_RADIX_1>(
e0, e1, clmap, dg, currComm, remoteComm, i, base, bound, cc, ccVal);
clusterWeight[i] += ccVal;
localTarget =
distGetMaxIndexSmall<SCC_SMALL_THRESHOLD_1, SCC_SMALL_RADIX_1>(
clmap, selfLoop, localCinfo, remoteCinfo, vDegree[i], ccSize,
ccDegree, cc, base, bound, constantForSecondTerm, ccVal);
} else if (e1 - e0 < SCC_SORT_THRESHOLD) {
static
#ifdef _OPENMP
thread_local
#endif
std::vector<std::pair<GraphElem, GraphWeight>>
clmap;
clmap.clear();
selfLoop = distBuildLocalMapCounterSort(
e0, e1, clmap, dg, currComm, remoteComm, i, base, bound, cc, ccVal);
clusterWeight[i] += ccVal;
localTarget = distGetMaxIndexSort(
clmap, selfLoop, localCinfo, remoteCinfo, vDegree[i], ccSize,
ccDegree, cc, base, bound, constantForSecondTerm, ccVal);
} else {
std::unordered_map<GraphElem, GraphWeight> clmap;
selfLoop = distBuildLocalMapCounter(e0, e1, clmap, dg, currComm, remoteComm, i, base, bound, cc, ccVal);
clusterWeight[i] += ccVal;
localTarget = distGetMaxIndex(clmap, selfLoop, localCinfo, remoteCinfo, vDegree[i], ccSize, ccDegree, cc, base, bound, constantForSecondTerm, ccVal);
}
}
else
localTarget = cc;
// is the Target Local?
if (localTarget >= base && localTarget < bound)
targetCommIsLocal = true;
// current and target comm are local - atomic updates to vectors
if ((localTarget != cc) && (localTarget != -1) && currCommIsLocal && targetCommIsLocal) {
#ifdef DEBUG_PRINTF
assert( base < localTarget < bound);
assert( base < cc < bound);
assert( cc - base < localCupdate.size());
assert( localTarget - base < localCupdate.size());
#endif
#pragma omp atomic update
localCupdate[localTarget-base].degree += vDegree[i];
#pragma omp atomic update
localCupdate[localTarget-base].size++;
#pragma omp atomic update
localCupdate[cc-base].degree -= vDegree[i];
#pragma omp atomic update
localCupdate[cc-base].size--;
}
// current is local, target is not - do atomic on local, accumulate in Maps for remote
if ((localTarget != cc) && (localTarget != -1) && currCommIsLocal && !targetCommIsLocal) {
#pragma omp atomic update
localCupdate[cc-base].degree -= vDegree[i];
#pragma omp atomic update
localCupdate[cc-base].size--;
// search target!
std::map<GraphElem,Comm>::iterator iter=remoteCupdate.find(localTarget);
#pragma omp atomic update
iter->second.degree += vDegree[i];
#pragma omp atomic update
iter->second.size++;
}
// current is remote, target is local - accumulate for current, atomic on local
if ((localTarget != cc) && (localTarget != -1) && !currCommIsLocal && targetCommIsLocal) {
#pragma omp atomic update
localCupdate[localTarget-base].degree += vDegree[i];
#pragma omp atomic update
localCupdate[localTarget-base].size++;
// search current
std::map<GraphElem,Comm>::iterator iter=remoteCupdate.find(cc);
#pragma omp atomic update
iter->second.degree -= vDegree[i];
#pragma omp atomic update
iter->second.size--;
}
// current and target are remote - accumulate for both
if ((localTarget != cc) && (localTarget != -1) && !currCommIsLocal && !targetCommIsLocal) {
// search current
std::map<GraphElem,Comm>::iterator iter = remoteCupdate.find(cc);
#pragma omp atomic update
iter->second.degree -= vDegree[i];
#pragma omp atomic update
iter->second.size--;
// search target
iter=remoteCupdate.find(localTarget);
#pragma omp atomic update
iter->second.degree += vDegree[i];
#pragma omp atomic update
iter->second.size++;
}
#ifdef DEBUG_PRINTF
assert(localTarget != -1);
#endif
targetComm[i] = localTarget;
} // distExecuteLouvainIteration
GraphWeight distComputeModularity(const Graph &g, std::vector<Comm> &localCinfo,
const std::vector<GraphWeight> &clusterWeight,
const GraphWeight constantForSecondTerm,
const int me)
{
const GraphElem nv = g.get_lnv();
MPI_Comm gcomm = g.get_comm();
GraphWeight le_la_xx[2];
GraphWeight e_a_xx[2] = {0.0, 0.0};
GraphWeight le_xx = 0.0, la2_x = 0.0;
#ifdef DEBUG_PRINTF
assert((clusterWeight.size() == nv));
#endif
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp parallel for default(shared), shared(clusterWeight, localCinfo), \
reduction(+: le_xx), reduction(+: la2_x) schedule(runtime)
#else
#pragma omp parallel for default(shared), shared(clusterWeight, localCinfo), \
reduction(+: le_xx), reduction(+: la2_x) schedule(static)
#endif
for (GraphElem i = 0L; i < nv; i++) {
le_xx += clusterWeight[i];
la2_x += static_cast<GraphWeight>(localCinfo[i].degree) * static_cast<GraphWeight>(localCinfo[i].degree);
}
le_la_xx[0] = le_xx;
le_la_xx[1] = la2_x;
#ifdef DEBUG_PRINTF
const double t0 = MPI_Wtime();
#endif
MPI_Allreduce(le_la_xx, e_a_xx, 2, MPI_WEIGHT_TYPE, MPI_SUM, gcomm);
#ifdef DEBUG_PRINTF
const double t1 = MPI_Wtime();
#endif
GraphWeight currMod = std::fabs((e_a_xx[0] * constantForSecondTerm) -
(e_a_xx[1] * constantForSecondTerm * constantForSecondTerm));
#ifdef DEBUG_PRINTF
std::cout << "[" << me << "]le_xx: " << le_xx << ", la2_x: " << la2_x << std::endl;
std::cout << "[" << me << "]e_xx: " << e_a_xx[0] << ", a2_x: " << e_a_xx[1] << ", currMod: " << currMod << std::endl;
std::cout << "[" << me << "]Reduction time: " << (t1 - t0) << std::endl;
#endif
return currMod;
} // distComputeModularity
void distUpdateLocalCinfo(std::vector<Comm> &localCinfo, const std::vector<Comm> &localCupdate)
{
size_t csz = localCinfo.size();
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp for schedule(runtime)
#else
#pragma omp for schedule(static)
#endif
for (GraphElem i = 0L; i < csz; i++) {
localCinfo[i].size += localCupdate[i].size;
localCinfo[i].degree += localCupdate[i].degree;
}
}
void distCleanCWandCU(const GraphElem nv, std::vector<GraphWeight> &clusterWeight,
std::vector<Comm> &localCupdate)
{
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp for schedule(runtime)
#else
#pragma omp for schedule(static)
#endif
for (GraphElem i = 0L; i < nv; i++) {
clusterWeight[i] = 0;
localCupdate[i].degree = 0;
localCupdate[i].size = 0;
}
} // distCleanCWandCU
#if defined(USE_MPI_RMA)
void fillRemoteCommunities(const Graph &dg, const int me, const int nprocs,
const size_t &ssz, const size_t &rsz, const std::vector<GraphElem> &ssizes,
const std::vector<GraphElem> &rsizes, const std::vector<GraphElem> &svdata,
const std::vector<GraphElem> &rvdata, const std::vector<GraphElem> &currComm,
const std::vector<Comm> &localCinfo, std::map<GraphElem,Comm> &remoteCinfo,
std::unordered_map<GraphElem, GraphElem> &remoteComm, std::map<GraphElem,Comm> &remoteCupdate,
const MPI_Win &commwin, const std::vector<GraphElem> &disp)
#else
void fillRemoteCommunities(const Graph &dg, const int me, const int nprocs,
const size_t &ssz, const size_t &rsz, const std::vector<GraphElem> &ssizes,
const std::vector<GraphElem> &rsizes, const std::vector<GraphElem> &svdata,
const std::vector<GraphElem> &rvdata, const std::vector<GraphElem> &currComm,
const std::vector<Comm> &localCinfo, std::map<GraphElem,Comm> &remoteCinfo,
std::unordered_map<GraphElem, GraphElem> &remoteComm, std::map<GraphElem,Comm> &remoteCupdate)
#endif
{
#if defined(USE_MPI_RMA)
std::vector<GraphElem> scdata(ssz);
#else
std::vector<GraphElem> rcdata(rsz), scdata(ssz);
#endif
GraphElem spos, rpos;
#if defined(REPLACE_STL_UOSET_WITH_VECTOR)
std::vector< std::vector< GraphElem > > rcinfo(nprocs);
#else
std::vector<std::unordered_set<GraphElem> > rcinfo(nprocs);
#endif
#if defined(USE_MPI_SENDRECV)
#else
std::vector<MPI_Request> rreqs(nprocs), sreqs(nprocs);
#endif
#ifdef DEBUG_PRINTF
double t0, t1, ta = 0.0;
#endif
const GraphElem base = dg.get_base(me), bound = dg.get_bound(me);
const GraphElem nv = dg.get_lnv();
MPI_Comm gcomm = dg.get_comm();
// Collects Communities of local vertices for remote nodes
#ifdef OMP_SCHEDULE_RUNTIME
#pragma omp parallel for shared(svdata, scdata, currComm) schedule(runtime)
#else
#pragma omp parallel for shared(svdata, scdata, currComm) schedule(static)
#endif
for (GraphElem i = 0; i < ssz; i++) {
const GraphElem vertex = svdata[i];
#ifdef DEBUG_PRINTF
assert((vertex >= base) && (vertex < bound));
#endif
const GraphElem comm = currComm[vertex - base];
scdata[i] = comm;
}
std::vector<GraphElem> rcsizes(nprocs), scsizes(nprocs);
std::vector<CommInfo> sinfo, rinfo;
#ifdef DEBUG_PRINTF
t0 = MPI_Wtime();
#endif
spos = 0;
rpos = 0;
#if defined(USE_MPI_COLLECTIVES)
std::vector<int> scnts(nprocs), rcnts(nprocs), sdispls(nprocs), rdispls(nprocs);
for (int i = 0; i < nprocs; i++) {
scnts[i] = ssizes[i];
rcnts[i] = rsizes[i];
sdispls[i] = spos;
rdispls[i] = rpos;
spos += scnts[i];
rpos += rcnts[i];
}
scnts[me] = 0;
rcnts[me] = 0;
MPI_Alltoallv(scdata.data(), scnts.data(), sdispls.data(),
MPI_GRAPH_TYPE, rcdata.data(), rcnts.data(), rdispls.data(),
MPI_GRAPH_TYPE, gcomm);
#elif defined(USE_MPI_RMA)
for (int i = 0; i < nprocs; i++) {
if ((i != me) && (ssizes[i] > 0)) {
#if defined(USE_MPI_ACCUMULATE)
MPI_Accumulate(scdata.data() + spos, ssizes[i], MPI_GRAPH_TYPE, i,
disp[i], ssizes[i], MPI_GRAPH_TYPE, MPI_REPLACE, commwin);
#else
MPI_Put(scdata.data() + spos, ssizes[i], MPI_GRAPH_TYPE, i,
disp[i], ssizes[i], MPI_GRAPH_TYPE, commwin);
#endif
}
spos += ssizes[i];
rpos += rsizes[i];
}
#elif defined(USE_MPI_SENDRECV)
for (int i = 0; i < nprocs; i++) {
if (i != me)
MPI_Sendrecv(scdata.data() + spos, ssizes[i], MPI_GRAPH_TYPE, i, CommunityTag,
rcdata.data() + rpos, rsizes[i], MPI_GRAPH_TYPE, i, CommunityTag,
gcomm, MPI_STATUSES_IGNORE);
spos += ssizes[i];
rpos += rsizes[i];
}
#else
for (int i = 0; i < nprocs; i++) {
if ((i != me) && (rsizes[i] > 0))
MPI_Irecv(rcdata.data() + rpos, rsizes[i], MPI_GRAPH_TYPE, i,
CommunityTag, gcomm, &rreqs[i]);
else
rreqs[i] = MPI_REQUEST_NULL;
rpos += rsizes[i];
}
for (int i = 0; i < nprocs; i++) {
if ((i != me) && (ssizes[i] > 0))
MPI_Isend(scdata.data() + spos, ssizes[i], MPI_GRAPH_TYPE, i,
CommunityTag, gcomm, &sreqs[i]);
else
sreqs[i] = MPI_REQUEST_NULL;
spos += ssizes[i];
}
MPI_Waitall(nprocs, sreqs.data(), MPI_STATUSES_IGNORE);
MPI_Waitall(nprocs, rreqs.data(), MPI_STATUSES_IGNORE);
#endif
#ifdef DEBUG_PRINTF
t1 = MPI_Wtime();
ta += (t1 - t0);
#endif
// reserve vectors
#if defined(REPLACE_STL_UOSET_WITH_VECTOR)
for (GraphElem i = 0; i < nprocs; i++) {
rcinfo[i].reserve(rpos);
}
#endif
// fetch baseptr from MPI window
#if defined(USE_MPI_RMA)
MPI_Win_flush_all(commwin);