.png){kind=icon}
返回
Scalable, Multi-Constraint, Complex-Objective Graph Partitioning
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2020.3002150.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce XtraPuLP, a distributed-memory graph partitioner designed to process irregular trillion-edge graphs. XtraPuLP is based on the scalable label propagation community detection technique, which has been demonstrated in various prior works as a viable means to produce high quality partitions of skewed and small-world graphs with minimal computation time. Our XtraPuLP implementation can also be generalized to compute partitions with an arbitrary number of constraints, and it can compute partitions with balanced communication load across all parts. On a collection of large sparse graphs, we show that XtraPuLP partitioning is considerably faster than state-of-the-art partitioning methods, while also demonstrating that XtraPuLP can produce partitions of real-world graphs with billion+ vertices and over a hundred billion edges in minutes. Additionally, we demonstrate XtraPuLP on a variety of applications, including large-scale graph analytics and sparse matrix-vector multiplication.
Keyword:
Partitioning algorithms
Scalability
Sparse matrices
Computational modeling
Rats
Indexes
Social networking (online)
Graph partitioning
load balancing
label propagation
graph analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Equation of state and phase transition of antigorite under high pressure and high temperature高温高压下叶辉石的状态方程和相变
PREAI
分享收藏
查看更多内容