Research Article
HPGraph: High-Performance Graph Analytics with Productivity on the GPU
Algorithm 1
Single-Source Shortest Path, expressed in HPGraph’s abstraction (G is the graph and P is the properties of vertices).
| (1) | procedure PREPROCESS , P, , | | (2) | | | (3) | | | (4) | | | (5) | | | (6) | end procedure | | (7) | | | (8) | procedure Generalized_SPMV , P, y, | | (9) | for do | | (10) | | | (11) | for in do | | (12) | if then | | (13) | | | (14) | end if | | (15) | end for | | (16) | | | (17) | end for | | (18) | end procedure | | (19) | | | (20) | procedure Gather , a, b | | (21) | return | | (22) | end procedure | | (23) | | | (24) | procedure Reduce a, b | | (25) | return | | (26) | end procedure | | (27) | | | (28) | procedure APPLY P, y, | | (29) | for do | | (30) | | | (31) | if then | | (32) | | | (33) | | | (34) | end if | | (35) | end for | | (36) | end procedure | | (37) | | | (38) | procedure Update a, b | | (39) | return | | (40) | end procedure |
|
