Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs
| dc.contributor.author | Then, Manuel | |
| dc.contributor.author | Günnemann, Stephan | |
| dc.contributor.author | Kemper, Alfons | |
| dc.contributor.author | Neumann, Thomas | |
| dc.date.accessioned | 2018-01-08T08:07:53Z | |
| dc.date.available | 2018-01-08T08:07:53Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Distance and centrality computations are important building blocks for modern graph databases as well as for dedicated graph analytics systems. Two commonly used centrality metrics are the compute-intense closeness and betweenness centralities, which require numerous expensive shortest distance calculations. We propose batched algorithm execution to run multiple distance and centrality computations at the same time and let them share common graph and data accesses. Batched execution amortizes the high cost of random memory accesses and presents new vectorization potential on modern CPUs and compute accelerators. We show how batched algorithm execution can be leveraged to significantly improve the performance of distance, closeness, and betweenness centrality calculations on unweighted and weighted graphs. Our evaluation demonstrates that batched execution can improve the runtime of these common metrics by over an order of magnitude. | |
| dc.identifier.pissn | 1610-1995 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11008 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Datenbank-Spektrum: Vol. 17, No. 2 | |
| dc.relation.ispartofseries | Datenbank-Spektrum | |
| dc.subject | Betweenness centrality | |
| dc.subject | Closeness centrality | |
| dc.subject | Graph analytics | |
| dc.subject | Graph databases | |
| dc.title | Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs | |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 182 | |
| gi.citation.startPage | 169 |