.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Big Data
graph analytics
graph traversal
betweenness centrality
breadth-first search
data locality
hypergraph
期刊
IF:
2.5
论文数:
1.1K
被引数:
1.3K
机构
引用论文
分享收藏分享收藏An Efficient Algorithm for Nonlinear Model Predictive Control of Large-Scale Systems Part I: Description of the Method (Ein effizienter Algorithmus für die nichtlineare prädiktive Regelung großer Systeme Teil I: Methodenbeschreibung)大型系统非线性模型预测控制的有效算法第一部分: 方法的描述 (Ein effizienter algorithms f ü r die nichtlineare pr ä diktive Regelung gro ß er Systeme Teil I: Methodenbeschreibung).png)
auto
autoIF0
PREAI
分享收藏
查看更多内容