An effective framework for asynchronous incremental graph processing

doi:10.1007/s11704-018-7443-z

An effective framework for asynchronous incremental graph processing

2018-08-30

15

PRE

AI

DOI：10.1007/s11704-018-7443-z

Original

Original request for help

Save

Abstract

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.

Keywords:

incremental computation

graph processing

iterative computation

asynchronous

convergence

An effective framework for asynchronous incremental graph processing

Abstract

AI Summary

Journal

Organization