.png){kind=icon}
.png){kind=icon}
Return
Hypergraph-based locality-enhancing methods for graph operations in Big Data applications
.png){kind=icon}
PRE
AI
DOI：10.1177/10943420231214532.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The need for speeding up data analytics increases inevitably due to the need for extracting valuable information from social media, data generated by smart devices with sensors, patterns of people's communications over the web, items viewed and bought by global-scale customers, cloud applications, etc., all of which take part in the Big Data. Such kind of interaction data is very well represented as sparse graphs to enable the graph analytics, which requires efficient underlying kernels. The breadth- first search (BFS)-based traversal is a commonly used kernel in graph algorithms such as the betweenness centrality algorithm for centrality analysis. In this work, we focus on parallel BFS operations and propose hypergraph-based combinatorial models that aim at reducing cache misses and hence exploiting data locality during the parallel BFS operations. Our models are based on finding new vertex visit orders so that locality in accessing the data associated with vertices is exploited. Experiments on graphs arising in a wide range of applications show that our proposed models achieve on average 9% performance improvement in the CPU-based Ligra data analytics framework.
Keywords:
Big Data
graph analytics
graph traversal
betweenness centrality
breadth-first search
data locality
hypergraph
Journal
IF:
2.5
Papers:
1.1K
Citations:
1.3K