-
Notifications
You must be signed in to change notification settings - Fork 3k
/
test_partition.py
2238 lines (2072 loc) · 73.5 KB
/
test_partition.py
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
import json
import os
import tempfile
import dgl
import dgl.backend as F
import dgl.graphbolt as gb
import numpy as np
import pytest
import torch as th
from dgl import function as fn
from dgl.distributed import (
dgl_partition_to_graphbolt,
load_partition,
load_partition_book,
load_partition_feats,
partition_graph,
)
from dgl.distributed.graph_partition_book import (
_etype_str_to_tuple,
_etype_tuple_to_str,
DEFAULT_ETYPE,
DEFAULT_NTYPE,
EdgePartitionPolicy,
HeteroDataName,
NodePartitionPolicy,
RangePartitionBook,
)
from dgl.distributed.partition import (
_get_inner_edge_mask,
_get_inner_node_mask,
RESERVED_FIELD_DTYPE,
)
from scipy import sparse as spsp
from utils import reset_envs
def _verify_partition_data_types(part_g):
"""
check list:
make sure nodes and edges have correct type.
"""
ndata = (
part_g.node_attributes
if isinstance(part_g, gb.FusedCSCSamplingGraph)
else part_g.ndata
)
edata = (
part_g.edge_attributes
if isinstance(part_g, gb.FusedCSCSamplingGraph)
else part_g.edata
)
for k, dtype in RESERVED_FIELD_DTYPE.items():
if k in ndata:
assert ndata[k].dtype == dtype
if k in edata:
assert edata[k].dtype == dtype
def _verify_partition_formats(part_g, formats):
# verify saved graph formats
if formats is None:
assert "coo" in part_g.formats()["created"]
else:
for format in formats:
assert format in part_g.formats()["created"]
def create_random_graph(n):
arr = (
spsp.random(n, n, density=0.001, format="coo", random_state=100) != 0
).astype(np.int64)
return dgl.from_scipy(arr)
def create_random_hetero():
num_nodes = {"n1": 1000, "n2": 1010, "n3": 1020}
etypes = [
("n1", "r1", "n2"),
("n2", "r1", "n1"),
("n1", "r2", "n3"),
("n2", "r3", "n3"),
]
edges = {}
for etype in etypes:
src_ntype, _, dst_ntype = etype
arr = spsp.random(
num_nodes[src_ntype],
num_nodes[dst_ntype],
density=0.001,
format="coo",
random_state=100,
)
edges[etype] = (arr.row, arr.col)
return dgl.heterograph(edges, num_nodes)
def _verify_graphbolt_attributes(
parts, store_inner_node, store_inner_edge, store_eids
):
"""
check list:
make sure arguments work.
"""
for part in parts:
assert store_inner_edge == ("inner_edge" in part.edge_attributes)
assert store_inner_node == ("inner_node" in part.node_attributes)
assert store_eids == (dgl.EID in part.edge_attributes)
def _verify_hetero_graph_node_edge_num(
g,
parts,
store_inner_edge,
debug_mode,
):
"""
check list:
make sure edge type are correct.
make sure the number of nodes in each node type are correct.
make sure the number of nodes in each node type are correct.
"""
num_nodes = {ntype: 0 for ntype in g.ntypes}
num_edges = {etype: 0 for etype in g.canonical_etypes}
for part in parts:
edata = (
part.edge_attributes
if isinstance(part, gb.FusedCSCSamplingGraph)
else part.edata
)
if dgl.ETYPE in edata:
# edata may not contain all edge types.
assert len(g.canonical_etypes) >= len(F.unique(edata[dgl.ETYPE]))
if debug_mode or isinstance(part, dgl.DGLGraph):
for ntype in g.ntypes:
ntype_id = g.get_ntype_id(ntype)
inner_node_mask = _get_inner_node_mask(part, ntype_id)
num_inner_nodes = F.sum(F.astype(inner_node_mask, F.int64), 0)
num_nodes[ntype] += num_inner_nodes
if store_inner_edge or isinstance(part, dgl.DGLGraph):
for etype in g.canonical_etypes:
etype_id = g.get_etype_id(etype)
inner_edge_mask = _get_inner_edge_mask(part, etype_id)
num_inner_edges = F.sum(F.astype(inner_edge_mask, F.int64), 0)
num_edges[etype] += num_inner_edges
# Verify the number of nodes are correct.
if debug_mode or isinstance(part, dgl.DGLGraph):
for ntype in g.ntypes:
print(
"node {}: {}, {}".format(
ntype, g.num_nodes(ntype), num_nodes[ntype]
)
)
assert g.num_nodes(ntype) == num_nodes[ntype]
# Verify the number of edges are correct.
if store_inner_edge or isinstance(part, dgl.DGLGraph):
for etype in g.canonical_etypes:
print(
"edge {}: {}, {}".format(
etype, g.num_edges(etype), num_edges[etype]
)
)
assert g.num_edges(etype) == num_edges[etype]
def _verify_edge_id_range_hetero(
g,
part,
eids,
):
"""
check list:
make sure inner_eids fall into a range.
make sure all edges are included.
"""
edata = (
part.edge_attributes
if isinstance(part, gb.FusedCSCSamplingGraph)
else part.edata
)
etype = (
part.type_per_edge
if isinstance(part, gb.FusedCSCSamplingGraph)
else edata[dgl.ETYPE]
)
eid = th.arange(len(edata[dgl.EID]))
etype_arr = F.gather_row(etype, eid)
eid_arr = F.gather_row(edata[dgl.EID], eid)
for etype in g.canonical_etypes:
etype_id = g.get_etype_id(etype)
eids[etype].append(F.boolean_mask(eid_arr, etype_arr == etype_id))
# Make sure edge Ids fall into a range.
inner_edge_mask = _get_inner_edge_mask(part, etype_id)
inner_eids = np.sort(
F.asnumpy(F.boolean_mask(edata[dgl.EID], inner_edge_mask))
)
assert np.all(
inner_eids == np.arange(inner_eids[0], inner_eids[-1] + 1)
)
return eids
def _verify_node_id_range_hetero(g, part, nids):
"""
check list:
make sure inner nodes have Ids fall into a range.
"""
for ntype in g.ntypes:
ntype_id = g.get_ntype_id(ntype)
# Make sure inner nodes have Ids fall into a range.
inner_node_mask = _get_inner_node_mask(part, ntype_id)
inner_nids = F.boolean_mask(
part.node_attributes[dgl.NID], inner_node_mask
)
assert np.all(
F.asnumpy(
inner_nids
== F.arange(
F.as_scalar(inner_nids[0]),
F.as_scalar(inner_nids[-1]) + 1,
)
)
)
nids[ntype].append(inner_nids)
return nids
def _verify_graph_attributes_hetero(
g,
parts,
store_inner_edge,
store_inner_node,
):
"""
check list:
make sure edge ids fall into a range.
make sure inner nodes have Ids fall into a range.
make sure all nodes is included.
make sure all edges is included.
"""
nids = {ntype: [] for ntype in g.ntypes}
eids = {etype: [] for etype in g.canonical_etypes}
# check edge id.
if store_inner_edge or isinstance(parts[0], dgl.DGLGraph):
for part in parts:
# collect eids
eids = _verify_edge_id_range_hetero(g, part, eids)
for etype in eids:
eids_type = F.cat(eids[etype], 0)
uniq_ids = F.unique(eids_type)
# We should get all nodes.
assert len(uniq_ids) == g.num_edges(etype)
# check node id.
if store_inner_node or isinstance(parts[0], dgl.DGLGraph):
for part in parts:
nids = _verify_node_id_range_hetero(g, part, nids)
for ntype in nids:
nids_type = F.cat(nids[ntype], 0)
uniq_ids = F.unique(nids_type)
# We should get all nodes.
assert len(uniq_ids) == g.num_nodes(ntype)
def _verify_hetero_graph(
g,
parts,
store_eids=False,
store_inner_edge=False,
store_inner_node=False,
debug_mode=False,
):
_verify_hetero_graph_node_edge_num(
g,
parts,
store_inner_edge=store_inner_edge,
debug_mode=debug_mode,
)
if store_eids:
_verify_graph_attributes_hetero(
g,
parts,
store_inner_edge=store_inner_edge,
store_inner_node=store_inner_node,
)
def _verify_node_feats(g, part, gpb, orig_nids, node_feats, is_homo=False):
for ntype in g.ntypes:
ndata = (
part.node_attributes
if isinstance(part, gb.FusedCSCSamplingGraph)
else part.ndata
)
ntype_id = g.get_ntype_id(ntype)
inner_node_mask = _get_inner_node_mask(
part,
ntype_id,
(gpb if isinstance(part, gb.FusedCSCSamplingGraph) else None),
)
inner_nids = F.boolean_mask(ndata[dgl.NID], inner_node_mask)
ntype_ids, inner_type_nids = gpb.map_to_per_ntype(inner_nids)
partid = gpb.nid2partid(inner_type_nids, ntype)
if is_homo:
assert np.all(F.asnumpy(ntype_ids) == ntype_id)
assert np.all(F.asnumpy(partid) == gpb.partid)
if is_homo:
orig_id = orig_nids[inner_type_nids]
else:
orig_id = orig_nids[ntype][inner_type_nids]
local_nids = gpb.nid2localnid(inner_type_nids, gpb.partid, ntype)
for name in g.nodes[ntype].data:
if name in [dgl.NID, "inner_node"]:
continue
true_feats = F.gather_row(g.nodes[ntype].data[name], orig_id)
ndata = F.gather_row(node_feats[ntype + "/" + name], local_nids)
assert np.all(F.asnumpy(ndata == true_feats))
def _verify_edge_feats(g, part, gpb, orig_eids, edge_feats, is_homo=False):
for etype in g.canonical_etypes:
edata = (
part.edge_attributes
if isinstance(part, gb.FusedCSCSamplingGraph)
else part.edata
)
etype_id = g.get_etype_id(etype)
inner_edge_mask = _get_inner_edge_mask(part, etype_id)
inner_eids = F.boolean_mask(edata[dgl.EID], inner_edge_mask)
etype_ids, inner_type_eids = gpb.map_to_per_etype(inner_eids)
partid = gpb.eid2partid(inner_type_eids, etype)
assert np.all(F.asnumpy(etype_ids) == etype_id)
assert np.all(F.asnumpy(partid) == gpb.partid)
if is_homo:
orig_id = orig_eids[inner_type_eids]
else:
orig_id = orig_eids[etype][inner_type_eids]
local_eids = gpb.eid2localeid(inner_type_eids, gpb.partid, etype)
for name in g.edges[etype].data:
if name in [dgl.EID, "inner_edge"]:
continue
true_feats = F.gather_row(g.edges[etype].data[name], orig_id)
edata = F.gather_row(
edge_feats[_etype_tuple_to_str(etype) + "/" + name],
local_eids,
)
assert np.all(F.asnumpy(edata == true_feats))
def verify_graph_feats_hetero_dgl(
g,
gpb,
part,
node_feats,
edge_feats,
orig_nids,
orig_eids,
):
"""
check list:
make sure the feats of nodes and edges are correct
"""
_verify_node_feats(g, part, gpb, orig_nids, node_feats)
_verify_edge_feats(g, part, gpb, orig_eids, edge_feats)
def verify_graph_feats_gb(
g,
gpbs,
parts,
tot_node_feats,
tot_edge_feats,
orig_nids,
orig_eids,
shuffled_labels,
shuffled_edata,
test_ntype,
test_etype,
store_inner_node=False,
store_inner_edge=False,
store_eids=False,
is_homo=False,
):
"""
check list:
make sure the feats of nodes and edges are correct
"""
for part_id in range(len(parts)):
part = parts[part_id]
gpb = gpbs[part_id]
node_feats = tot_node_feats[part_id]
edge_feats = tot_edge_feats[part_id]
if store_inner_node:
_verify_node_feats(
g,
part,
gpb,
orig_nids,
node_feats,
is_homo=is_homo,
)
if store_inner_edge and store_eids:
_verify_edge_feats(
g,
part,
gpb,
orig_eids,
edge_feats,
is_homo=is_homo,
)
_verify_shuffled_labels_gb(
g,
shuffled_labels,
shuffled_edata,
orig_nids,
orig_eids,
test_ntype,
test_etype,
)
def check_hetero_partition(
hg,
part_method,
num_parts=4,
num_trainers_per_machine=1,
load_feats=True,
graph_formats=None,
):
test_ntype = "n1"
test_etype = ("n1", "r1", "n2")
hg.nodes[test_ntype].data["labels"] = F.arange(0, hg.num_nodes(test_ntype))
hg.nodes[test_ntype].data["feats"] = F.tensor(
np.random.randn(hg.num_nodes(test_ntype), 10), F.float32
)
hg.edges[test_etype].data["feats"] = F.tensor(
np.random.randn(hg.num_edges(test_etype), 10), F.float32
)
hg.edges[test_etype].data["labels"] = F.arange(0, hg.num_edges(test_etype))
num_hops = 1
orig_nids, orig_eids = partition_graph(
hg,
"test",
num_parts,
"/tmp/partition",
num_hops=num_hops,
part_method=part_method,
return_mapping=True,
num_trainers_per_machine=num_trainers_per_machine,
graph_formats=graph_formats,
)
assert len(orig_nids) == len(hg.ntypes)
assert len(orig_eids) == len(hg.canonical_etypes)
for ntype in hg.ntypes:
assert len(orig_nids[ntype]) == hg.num_nodes(ntype)
for etype in hg.canonical_etypes:
assert len(orig_eids[etype]) == hg.num_edges(etype)
parts = []
shuffled_labels = []
shuffled_elabels = []
for i in range(num_parts):
part_g, node_feats, edge_feats, gpb, _, _, _ = load_partition(
"/tmp/partition/test.json", i, load_feats=load_feats
)
_verify_partition_data_types(part_g)
_verify_partition_formats(part_g, graph_formats)
if not load_feats:
assert not node_feats
assert not edge_feats
node_feats, edge_feats = load_partition_feats(
"/tmp/partition/test.json", i
)
if num_trainers_per_machine > 1:
for ntype in hg.ntypes:
name = ntype + "/trainer_id"
assert name in node_feats
part_ids = F.floor_div(
node_feats[name], num_trainers_per_machine
)
assert np.all(F.asnumpy(part_ids) == i)
for etype in hg.canonical_etypes:
name = _etype_tuple_to_str(etype) + "/trainer_id"
assert name in edge_feats
part_ids = F.floor_div(
edge_feats[name], num_trainers_per_machine
)
assert np.all(F.asnumpy(part_ids) == i)
# Verify the mapping between the reshuffled IDs and the original IDs.
# These are partition-local IDs.
part_src_ids, part_dst_ids = part_g.edges()
# These are reshuffled global homogeneous IDs.
part_src_ids = F.gather_row(part_g.ndata[dgl.NID], part_src_ids)
part_dst_ids = F.gather_row(part_g.ndata[dgl.NID], part_dst_ids)
part_eids = part_g.edata[dgl.EID]
# These are reshuffled per-type IDs.
src_ntype_ids, part_src_ids = gpb.map_to_per_ntype(part_src_ids)
dst_ntype_ids, part_dst_ids = gpb.map_to_per_ntype(part_dst_ids)
etype_ids, part_eids = gpb.map_to_per_etype(part_eids)
# `IdMap` is in int64 by default.
assert src_ntype_ids.dtype == F.int64
assert dst_ntype_ids.dtype == F.int64
assert etype_ids.dtype == F.int64
with pytest.raises(dgl.utils.internal.InconsistentDtypeException):
gpb.map_to_per_ntype(F.tensor([0], F.int32))
with pytest.raises(dgl.utils.internal.InconsistentDtypeException):
gpb.map_to_per_etype(F.tensor([0], F.int32))
# These are original per-type IDs.
for etype_id, etype in enumerate(hg.canonical_etypes):
if F.sum((etype_ids == etype_id), 0) == 0:
continue
part_src_ids1 = F.boolean_mask(part_src_ids, etype_ids == etype_id)
src_ntype_ids1 = F.boolean_mask(
src_ntype_ids, etype_ids == etype_id
)
part_dst_ids1 = F.boolean_mask(part_dst_ids, etype_ids == etype_id)
dst_ntype_ids1 = F.boolean_mask(
dst_ntype_ids, etype_ids == etype_id
)
part_eids1 = F.boolean_mask(part_eids, etype_ids == etype_id)
assert np.all(F.asnumpy(src_ntype_ids1 == src_ntype_ids1[0]))
assert np.all(F.asnumpy(dst_ntype_ids1 == dst_ntype_ids1[0]))
src_ntype = hg.ntypes[F.as_scalar(src_ntype_ids1[0])]
dst_ntype = hg.ntypes[F.as_scalar(dst_ntype_ids1[0])]
orig_src_ids1 = F.gather_row(orig_nids[src_ntype], part_src_ids1)
orig_dst_ids1 = F.gather_row(orig_nids[dst_ntype], part_dst_ids1)
orig_eids1 = F.gather_row(orig_eids[etype], part_eids1)
orig_eids2 = hg.edge_ids(orig_src_ids1, orig_dst_ids1, etype=etype)
assert len(orig_eids1) == len(orig_eids2)
assert np.all(F.asnumpy(orig_eids1) == F.asnumpy(orig_eids2))
parts.append(part_g)
verify_graph_feats_hetero_dgl(
hg, gpb, part_g, node_feats, edge_feats, orig_nids, orig_eids
)
shuffled_labels.append(node_feats[test_ntype + "/labels"])
shuffled_elabels.append(
edge_feats[_etype_tuple_to_str(test_etype) + "/labels"]
)
_verify_hetero_graph(hg, parts)
shuffled_labels = F.asnumpy(F.cat(shuffled_labels, 0))
shuffled_elabels = F.asnumpy(F.cat(shuffled_elabels, 0))
orig_labels = np.zeros(shuffled_labels.shape, dtype=shuffled_labels.dtype)
orig_elabels = np.zeros(
shuffled_elabels.shape, dtype=shuffled_elabels.dtype
)
orig_labels[F.asnumpy(orig_nids[test_ntype])] = shuffled_labels
orig_elabels[F.asnumpy(orig_eids[test_etype])] = shuffled_elabels
assert np.all(orig_labels == F.asnumpy(hg.nodes[test_ntype].data["labels"]))
assert np.all(
orig_elabels == F.asnumpy(hg.edges[test_etype].data["labels"])
)
def check_partition(
g,
part_method,
num_parts=4,
num_trainers_per_machine=1,
load_feats=True,
graph_formats=None,
):
g.ndata["labels"] = F.arange(0, g.num_nodes())
g.ndata["feats"] = F.tensor(np.random.randn(g.num_nodes(), 10), F.float32)
g.edata["feats"] = F.tensor(np.random.randn(g.num_edges(), 10), F.float32)
g.update_all(fn.copy_u("feats", "msg"), fn.sum("msg", "h"))
g.update_all(fn.copy_e("feats", "msg"), fn.sum("msg", "eh"))
num_hops = 2
orig_nids, orig_eids = partition_graph(
g,
"test",
num_parts,
"/tmp/partition",
num_hops=num_hops,
part_method=part_method,
return_mapping=True,
num_trainers_per_machine=num_trainers_per_machine,
graph_formats=graph_formats,
)
part_sizes = []
shuffled_labels = []
shuffled_edata = []
for i in range(num_parts):
part_g, node_feats, edge_feats, gpb, _, _, _ = load_partition(
"/tmp/partition/test.json", i, load_feats=load_feats
)
_verify_partition_data_types(part_g)
_verify_partition_formats(part_g, graph_formats)
if not load_feats:
assert not node_feats
assert not edge_feats
node_feats, edge_feats = load_partition_feats(
"/tmp/partition/test.json", i
)
if num_trainers_per_machine > 1:
for ntype in g.ntypes:
name = ntype + "/trainer_id"
assert name in node_feats
part_ids = F.floor_div(
node_feats[name], num_trainers_per_machine
)
assert np.all(F.asnumpy(part_ids) == i)
for etype in g.canonical_etypes:
name = _etype_tuple_to_str(etype) + "/trainer_id"
assert name in edge_feats
part_ids = F.floor_div(
edge_feats[name], num_trainers_per_machine
)
assert np.all(F.asnumpy(part_ids) == i)
# Check the metadata
assert gpb._num_nodes() == g.num_nodes()
assert gpb._num_edges() == g.num_edges()
assert gpb.num_partitions() == num_parts
gpb_meta = gpb.metadata()
assert len(gpb_meta) == num_parts
assert len(gpb.partid2nids(i)) == gpb_meta[i]["num_nodes"]
assert len(gpb.partid2eids(i)) == gpb_meta[i]["num_edges"]
part_sizes.append((gpb_meta[i]["num_nodes"], gpb_meta[i]["num_edges"]))
nid = F.boolean_mask(part_g.ndata[dgl.NID], part_g.ndata["inner_node"])
local_nid = gpb.nid2localnid(nid, i)
assert F.dtype(local_nid) in (F.int64, F.int32)
assert np.all(F.asnumpy(local_nid) == np.arange(0, len(local_nid)))
eid = F.boolean_mask(part_g.edata[dgl.EID], part_g.edata["inner_edge"])
local_eid = gpb.eid2localeid(eid, i)
assert F.dtype(local_eid) in (F.int64, F.int32)
assert np.all(F.asnumpy(local_eid) == np.arange(0, len(local_eid)))
# Check the node map.
local_nodes = F.boolean_mask(
part_g.ndata[dgl.NID], part_g.ndata["inner_node"]
)
llocal_nodes = F.nonzero_1d(part_g.ndata["inner_node"])
local_nodes1 = gpb.partid2nids(i)
assert F.dtype(local_nodes1) in (F.int32, F.int64)
assert np.all(
np.sort(F.asnumpy(local_nodes)) == np.sort(F.asnumpy(local_nodes1))
)
assert np.all(F.asnumpy(llocal_nodes) == np.arange(len(llocal_nodes)))
# Check the edge map.
local_edges = F.boolean_mask(
part_g.edata[dgl.EID], part_g.edata["inner_edge"]
)
llocal_edges = F.nonzero_1d(part_g.edata["inner_edge"])
local_edges1 = gpb.partid2eids(i)
assert F.dtype(local_edges1) in (F.int32, F.int64)
assert np.all(
np.sort(F.asnumpy(local_edges)) == np.sort(F.asnumpy(local_edges1))
)
assert np.all(F.asnumpy(llocal_edges) == np.arange(len(llocal_edges)))
# Verify the mapping between the reshuffled IDs and the original IDs.
part_src_ids, part_dst_ids = part_g.edges()
part_src_ids = F.gather_row(part_g.ndata[dgl.NID], part_src_ids)
part_dst_ids = F.gather_row(part_g.ndata[dgl.NID], part_dst_ids)
part_eids = part_g.edata[dgl.EID]
orig_src_ids = F.gather_row(orig_nids, part_src_ids)
orig_dst_ids = F.gather_row(orig_nids, part_dst_ids)
orig_eids1 = F.gather_row(orig_eids, part_eids)
orig_eids2 = g.edge_ids(orig_src_ids, orig_dst_ids)
assert F.shape(orig_eids1)[0] == F.shape(orig_eids2)[0]
assert np.all(F.asnumpy(orig_eids1) == F.asnumpy(orig_eids2))
local_orig_nids = orig_nids[part_g.ndata[dgl.NID]]
local_orig_eids = orig_eids[part_g.edata[dgl.EID]]
part_g.ndata["feats"] = F.gather_row(g.ndata["feats"], local_orig_nids)
part_g.edata["feats"] = F.gather_row(g.edata["feats"], local_orig_eids)
local_nodes = orig_nids[local_nodes]
local_edges = orig_eids[local_edges]
part_g.update_all(fn.copy_u("feats", "msg"), fn.sum("msg", "h"))
part_g.update_all(fn.copy_e("feats", "msg"), fn.sum("msg", "eh"))
assert F.allclose(
F.gather_row(g.ndata["h"], local_nodes),
F.gather_row(part_g.ndata["h"], llocal_nodes),
)
assert F.allclose(
F.gather_row(g.ndata["eh"], local_nodes),
F.gather_row(part_g.ndata["eh"], llocal_nodes),
)
for name in ["labels", "feats"]:
assert "_N/" + name in node_feats
assert node_feats["_N/" + name].shape[0] == len(local_nodes)
true_feats = F.gather_row(g.ndata[name], local_nodes)
ndata = F.gather_row(node_feats["_N/" + name], local_nid)
assert np.all(F.asnumpy(true_feats) == F.asnumpy(ndata))
for name in ["feats"]:
efeat_name = _etype_tuple_to_str(DEFAULT_ETYPE) + "/" + name
assert efeat_name in edge_feats
assert edge_feats[efeat_name].shape[0] == len(local_edges)
true_feats = F.gather_row(g.edata[name], local_edges)
edata = F.gather_row(edge_feats[efeat_name], local_eid)
assert np.all(F.asnumpy(true_feats) == F.asnumpy(edata))
# This only works if node/edge IDs are shuffled.
shuffled_labels.append(node_feats["_N/labels"])
shuffled_edata.append(edge_feats["_N:_E:_N/feats"])
# Verify that we can reconstruct node/edge data for original IDs.
shuffled_labels = F.asnumpy(F.cat(shuffled_labels, 0))
shuffled_edata = F.asnumpy(F.cat(shuffled_edata, 0))
orig_labels = np.zeros(shuffled_labels.shape, dtype=shuffled_labels.dtype)
orig_edata = np.zeros(shuffled_edata.shape, dtype=shuffled_edata.dtype)
orig_labels[F.asnumpy(orig_nids)] = shuffled_labels
orig_edata[F.asnumpy(orig_eids)] = shuffled_edata
assert np.all(orig_labels == F.asnumpy(g.ndata["labels"]))
assert np.all(orig_edata == F.asnumpy(g.edata["feats"]))
node_map = []
edge_map = []
for i, (num_nodes, num_edges) in enumerate(part_sizes):
node_map.append(np.ones(num_nodes) * i)
edge_map.append(np.ones(num_edges) * i)
node_map = np.concatenate(node_map)
edge_map = np.concatenate(edge_map)
nid2pid = gpb.nid2partid(F.arange(0, len(node_map)))
assert F.dtype(nid2pid) in (F.int32, F.int64)
assert np.all(F.asnumpy(nid2pid) == node_map)
eid2pid = gpb.eid2partid(F.arange(0, len(edge_map)))
assert F.dtype(eid2pid) in (F.int32, F.int64)
assert np.all(F.asnumpy(eid2pid) == edge_map)
@pytest.mark.parametrize("part_method", ["metis", "random"])
@pytest.mark.parametrize("num_parts", [1, 4])
@pytest.mark.parametrize("num_trainers_per_machine", [1])
@pytest.mark.parametrize("load_feats", [True, False])
@pytest.mark.parametrize(
"graph_formats", [None, ["csc"], ["coo", "csc"], ["coo", "csc", "csr"]]
)
def test_partition(
part_method,
num_parts,
num_trainers_per_machine,
load_feats,
graph_formats,
):
os.environ["DGL_DIST_DEBUG"] = "1"
if part_method == "random" and num_parts > 1:
num_trainers_per_machine = 1
g = create_random_graph(1000)
check_partition(
g,
part_method,
num_parts,
num_trainers_per_machine,
load_feats,
graph_formats,
)
hg = create_random_hetero()
check_hetero_partition(
hg,
part_method,
num_parts,
num_trainers_per_machine,
load_feats,
graph_formats,
)
reset_envs()
@pytest.mark.parametrize("node_map_dtype", [F.int32, F.int64])
@pytest.mark.parametrize("edge_map_dtype", [F.int32, F.int64])
def test_RangePartitionBook(node_map_dtype, edge_map_dtype):
part_id = 1
num_parts = 2
# homogeneous
node_map = {
DEFAULT_NTYPE: F.tensor([[0, 1000], [1000, 2000]], dtype=node_map_dtype)
}
edge_map = {
DEFAULT_ETYPE: F.tensor(
[[0, 5000], [5000, 10000]], dtype=edge_map_dtype
)
}
ntypes = {DEFAULT_NTYPE: 0}
etypes = {DEFAULT_ETYPE: 0}
gpb = RangePartitionBook(
part_id, num_parts, node_map, edge_map, ntypes, etypes
)
assert gpb.etypes == [DEFAULT_ETYPE[1]]
assert gpb.canonical_etypes == [DEFAULT_ETYPE]
assert gpb.to_canonical_etype(DEFAULT_ETYPE[1]) == DEFAULT_ETYPE
ntype_ids, per_ntype_ids = gpb.map_to_per_ntype(
F.tensor([0, 1000], dtype=node_map_dtype)
)
assert ntype_ids.dtype == node_map_dtype
assert per_ntype_ids.dtype == node_map_dtype
assert np.all(F.asnumpy(ntype_ids) == 0)
assert np.all(F.asnumpy(per_ntype_ids) == [0, 1000])
etype_ids, per_etype_ids = gpb.map_to_per_etype(
F.tensor([0, 5000], dtype=edge_map_dtype)
)
assert etype_ids.dtype == edge_map_dtype
assert per_etype_ids.dtype == edge_map_dtype
assert np.all(F.asnumpy(etype_ids) == 0)
assert np.all(F.asnumpy(per_etype_ids) == [0, 5000])
node_policy = NodePartitionPolicy(gpb, DEFAULT_NTYPE)
assert node_policy.type_name == DEFAULT_NTYPE
edge_policy = EdgePartitionPolicy(gpb, DEFAULT_ETYPE)
assert edge_policy.type_name == DEFAULT_ETYPE
# Init via etype is not supported
node_map = {
"node1": F.tensor([[0, 1000], [1000, 2000]], dtype=node_map_dtype),
"node2": F.tensor([[0, 1000], [1000, 2000]], dtype=node_map_dtype),
}
edge_map = {
"edge1": F.tensor([[0, 5000], [5000, 10000]], dtype=edge_map_dtype)
}
ntypes = {"node1": 0, "node2": 1}
etypes = {"edge1": 0}
expect_except = False
try:
RangePartitionBook(
part_id, num_parts, node_map, edge_map, ntypes, etypes
)
except AssertionError:
expect_except = True
assert expect_except
expect_except = False
try:
EdgePartitionPolicy(gpb, "edge1")
except AssertionError:
expect_except = True
assert expect_except
# heterogeneous, init via canonical etype
node_map = {
"node1": F.tensor([[0, 1000], [1000, 2000]], dtype=node_map_dtype),
"node2": F.tensor([[0, 1000], [1000, 2000]], dtype=node_map_dtype),
}
edge_map = {
("node1", "edge1", "node2"): F.tensor(
[[0, 5000], [5000, 10000]], dtype=edge_map_dtype
)
}
ntypes = {"node1": 0, "node2": 1}
etypes = {("node1", "edge1", "node2"): 0}
c_etype = list(etypes.keys())[0]
gpb = RangePartitionBook(
part_id, num_parts, node_map, edge_map, ntypes, etypes
)
assert gpb.etypes == ["edge1"]
assert gpb.canonical_etypes == [c_etype]
assert gpb.to_canonical_etype("edge1") == c_etype
assert gpb.to_canonical_etype(c_etype) == c_etype
ntype_ids, per_ntype_ids = gpb.map_to_per_ntype(
F.tensor([0, 1000], dtype=node_map_dtype)
)
assert ntype_ids.dtype == node_map_dtype
assert per_ntype_ids.dtype == node_map_dtype
assert np.all(F.asnumpy(ntype_ids) == 0)
assert np.all(F.asnumpy(per_ntype_ids) == [0, 1000])
etype_ids, per_etype_ids = gpb.map_to_per_etype(
F.tensor([0, 5000], dtype=edge_map_dtype)
)
assert etype_ids.dtype == edge_map_dtype
assert per_etype_ids.dtype == edge_map_dtype
assert np.all(F.asnumpy(etype_ids) == 0)
assert np.all(F.asnumpy(per_etype_ids) == [0, 5000])
expect_except = False
try:
gpb.to_canonical_etype(("node1", "edge2", "node2"))
except BaseException:
expect_except = True
assert expect_except
expect_except = False
try:
gpb.to_canonical_etype("edge2")
except BaseException:
expect_except = True
assert expect_except
# NodePartitionPolicy
node_policy = NodePartitionPolicy(gpb, "node1")
assert node_policy.type_name == "node1"
assert node_policy.policy_str == "node~node1"
assert node_policy.part_id == part_id
assert node_policy.is_node
assert node_policy.get_data_name("x").is_node()
local_ids = th.arange(0, 1000)
global_ids = local_ids + 1000
assert th.equal(node_policy.to_local(global_ids), local_ids)
assert th.all(node_policy.to_partid(global_ids) == part_id)
assert node_policy.get_part_size() == 1000
assert node_policy.get_size() == 2000
# EdgePartitionPolicy
edge_policy = EdgePartitionPolicy(gpb, c_etype)
assert edge_policy.type_name == c_etype
assert edge_policy.policy_str == "edge~node1:edge1:node2"
assert edge_policy.part_id == part_id
assert not edge_policy.is_node
assert not edge_policy.get_data_name("x").is_node()
local_ids = th.arange(0, 5000)
global_ids = local_ids + 5000
assert th.equal(edge_policy.to_local(global_ids), local_ids)
assert th.all(edge_policy.to_partid(global_ids) == part_id)
assert edge_policy.get_part_size() == 5000
assert edge_policy.get_size() == 10000
expect_except = False
try:
HeteroDataName(False, "edge1", "feat")
except BaseException:
expect_except = True
assert expect_except
data_name = HeteroDataName(False, c_etype, "feat")
assert data_name.get_type() == c_etype
def test_UnknownPartitionBook():
node_map = {"_N": {0: 0, 1: 1, 2: 2}}
edge_map = {"_N:_E:_N": {0: 0, 1: 1, 2: 2}}
part_metadata = {
"num_parts": 1,
"num_nodes": len(node_map),
"num_edges": len(edge_map),
"node_map": node_map,
"edge_map": edge_map,
"graph_name": "test_graph",
}
with tempfile.TemporaryDirectory() as test_dir:
part_config = os.path.join(test_dir, "test_graph.json")
with open(part_config, "w") as file:
json.dump(part_metadata, file, indent=4)
try:
load_partition_book(part_config, 0)
except Exception as e:
if not isinstance(e, TypeError):
raise e
@pytest.mark.parametrize("part_method", ["metis", "random"])
@pytest.mark.parametrize("num_parts", [1, 4])
@pytest.mark.parametrize("store_eids", [True, False])
@pytest.mark.parametrize("store_inner_node", [True, False])
@pytest.mark.parametrize("store_inner_edge", [True, False])
@pytest.mark.parametrize("debug_mode", [True, False])
def test_dgl_partition_to_graphbolt_homo(
part_method,
num_parts,
store_eids,
store_inner_node,
store_inner_edge,
debug_mode,
):
reset_envs()
if debug_mode:
os.environ["DGL_DIST_DEBUG"] = "1"
with tempfile.TemporaryDirectory() as test_dir:
g = create_random_graph(1000)
graph_name = "test"
partition_graph(
g, graph_name, num_parts, test_dir, part_method=part_method
)
part_config = os.path.join(test_dir, f"{graph_name}.json")
dgl_partition_to_graphbolt(
part_config,
store_eids=store_eids,
store_inner_node=store_inner_node,
store_inner_edge=store_inner_edge,
)
for part_id in range(num_parts):
orig_g = dgl.load_graphs(
os.path.join(test_dir, f"part{part_id}/graph.dgl")
)[0][0]
new_g = load_partition(
part_config, part_id, load_feats=False, use_graphbolt=True
)[0]
orig_indptr, orig_indices, orig_eids = orig_g.adj().csc()
# The original graph is in int64 while the partitioned graph is in
# int32 as dtype formatting is applied when converting to graphbolt
# format.
assert orig_indptr.dtype == th.int64