.png){kind=icon}
.png){kind=icon}
Return
Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2023.3310071.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Delay Tolerant Network (DTN) is a widely used network in computer network and wireless network, there are no permanent end-to-end connections between source and destination nodes (vertices). Betweenness centrality (BC) is used to find the key nodes (vertices) of DTNs, and there are kinds of implementations of the BC algorithm for DTNs. However, most recent algorithms in BC computation suffer from the problem of high auxiliary memory consumption. To reduce BC computing's memory consumption, we propose a path-merging-based algorithm called Galliot to calculate the BC values using GPU, which aims to minimize the on-board memory consumption and enable the BC computation of large-scale graphs on GPU. The proposed algorithm requires O(n) space and runs in O(mn) time on unweighted graphs. We present the theoretical principle for the proposed path merging method. Moreover, we propose a locality-oriented policy to maintain and update the worklist to improve GPU data locality. In addition, we conducted extensive experiments on NVIDIA GPUs to show the performance of Galliot. The results show that Galliot can process the larger graphs, which have 11.32x more vertices and 5.67x more edges than the graphs that recent works can process. Moreover, Galliot can achieve up to 38.77x speedup over the existing methods.
Keywords:
Betweenness centrality
path merging method
edge sharing
GPGPU
parallelism
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W