id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_uz5h6qoj2bhtlc5p3xsqkevrpq	Rui Fan	A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks	2017	23	.pdf	application/pdf	10953	1382	68	performance, we integrate the work-efficient strategy, and to address the loadimbalance problem, we introduce a warp-centric technique, which assigns many � We compare the traditional node-parallel method with the work-efficient version and In the edgeand node-parallel strategies, threads are assigned to all vertices or edges, To compute the BC on a weighted network, a parallel SSSP algorithm is applied in the both the node-parallel and work-efficient methods, resulting in four algorithms with work-efficient algorithm performs better than the node-parallel algorithm on all networks graphs, the warp-centric method results in even worse performance than the node-parallel node-parallel and work-efficient implementations combined with the warp-centric work-efficient method, algorithms with smaller WARP_SIZE values also perform better A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks	./cache/work_uz5h6qoj2bhtlc5p3xsqkevrpq.pdf	./txt/work_uz5h6qoj2bhtlc5p3xsqkevrpq.txt