.png){kind=icon}
返回
Exploring big graph computing - An empirical study from architectural perspective
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2016.07.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph computing is widely applied in a large number of big data applications. Despite its importance, high performance graph computing remains a challenge, especially for large-scale graphs. In this paper, by analyzing from the architectural perspective, we study computational behaviors of graph computing in real-world use cases. We benchmark a set of representative graph algorithms implemented on a unified framework and conduct experiments to analyze comprehensive performance characteristics. In the characterization, we observed multiple insights, including irregular memory patterns, significant diverse behavior across different computations, highly data dependent behaviors, etc., using large-scale synthetic and real-world graphs. To the best of our knowledge, this is the first comprehensive architectural study on the full-scope of graph computing. It can improve our understanding on graph computing and help high performance computing research for graph-based big data applications. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Graph computing
Architectural characterization
Big data
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
Improved Particle Size Control for the Dispersion Polymerization of Methyl methacrylate in Supercritical Carbon Dioxide超临界二氧化碳中甲基丙烯酸甲酯分散聚合的改进粒度控制OAAI
OAAI分享收藏分享收藏
查看更多内容