arrow
返回

SPFC: An Effective Optimization for Vertex-Centric Graph Processing Systems

delete2019-01-01
delete0
PRE
AI
曹英杰 封面图
曹英杰 (Yingjie Cao)
Y
Yangyang Zhang
M
Md Zakirul Alam Bhuiyan
B
Bo Li
DOI:10.1109/TSUSC.2017.2780320delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The real-world demands of mining big data and smart data of graph structure have led to an active research of distributed graph processing. Many distributed graph processing systems [19], [22], [23] adopt a vertex-centric programming paradigm. In these systems, messages are passed between vertices to propagate the latest states. The communication efficiency and the high overhead of synchronization are two key considerations of these systems [8], [12]. In this paper, we propose a Slow Passing Fast Consuming (SPFC) approach which can effectively improve the overall performance of vertex-centric graph processing systems. In our approach, the message passing is slow but the consuming is fast. More specifically, at the message sender side, priority is given to those smart messages which contribute more to the algorithm convergence, and at the message receiver side, messages are consumed right after arriving without any delay and intermediate buffer. Besides, by using a two-phase termination check protocol, the global synchronous barrier can be completely eliminated. In addition, based on the slow message passing strategy, further performance improvement can be achieved with some accuracy loss by eliminating those messages which are less useful for algorithm convergence. We implement our approach based on Apache Giraph [1] and evaluate it on a 12-machine cluster. The experimental results show that our method can effectively reduce the amount of message traffic and achieve up to an order of magnitude performance improvement compared with Giraph and GraphLab [3].
Keyword:
Large-scale graph data processing
communication efficiency
smart message
global synchronization
approximate computation
performance improvement
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
IEEE Transactions on Cloud Computing
IF:
5
论文数:
1.8K
被引数:
4.3K

机构

B
Beihang University
学者数:
5.2W
论文数: 4.1W
被引数: 37
F
Fordham University
学者数:
1.8K
论文数: 2.1K
被引数: 2.3K
引用论文

引用论文

Structural elucidation of synthetic calcium silicates
err2012-02-29
err0
PREAI
errThomas Borrmann; James H. Johnston; Andrew J. McFarlane; Kenneth J. D. MacKenzie; Akihiko Nukui
err分享
err收藏
Evaluation of Ice-Adhesion Strength on Erosion-Resistant Materials
err2015-07-01
err0
PREAI
errJared Soltis; Jose Palacios; Timothy Eden; Douglas Wolfe
err分享
err收藏
A Genomewide Screen for Tolerance to Cationic Drugs Reveals Genes Important for Potassium Homeostasis in Saccharomyces cerevisiae
err2011-09-01
err0
errOAAI
errLina Barreto; David Canadell; Silvia Petrezsélyová; Clara Navarrete; Lydie Marešová; Jorge Peréz-Valle; Rito Herrera; Iván Olier; Jesús Giraldo; Hana Sychrová; Lynne Yenush; José Ramos; Joaquín Ariño
err分享
err收藏
Ring: Real-Time Emerging Anomaly Monitoring System Over Text StreamsRing: 基于文本流的实时新兴异常监测系统
err2019-12-01
err38
PREAI
errYu, Weiren; Li, Jianxin; Bhuiyan, Md Zakirul Alam; Zhang, Richong; Huai, Jinpeng
err分享
err收藏
学者 查看更多内容