.png){kind=icon}
返回
An effective framework for asynchronous incremental graph processing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-018-7443-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-to-date. Incremental computation is demonstrated to be an efficient solution to update calculated results. Recently, many incremental graph processing systems have been proposed to handle dynamic graphs in an asynchronous way and are able to achieve better performance than those processed in a synchronous way. However, these solutions still suffer from suboptimal convergence speed due to their slow propagation of important vertex state (important to convergence speed) and poor locality. In order to solve these problems, we propose a novel graph processing framework. It introduces a dynamic partition method to gather the important vertices for high locality, and then uses a priority-based scheduling algorithm to assign them with a higher priority for an effective processing order. By such means, it is able to reduce the number of updates and increase the locality, thereby reducing the convergence time. Experimental results show that our method reduces the number of updates by 30%, and reduces the total execution time by 35%, compared with state-of-the-art systems.
Keyword:
incremental computation
graph processing
iterative computation
asynchronous
convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Best Practices Recommendations in the Application of Immunohistochemistry in Testicular Tumors免疫组织化学在睾丸肿瘤中应用的最佳实践建议
PREAI
分享收藏
查看更多内容