GraphTune: An Efficient Dependency-aware Substrate to Alleviate Irregularity in Concurrent Graph Processing

• Published in: ACM transactions on architecture and code optimization 2023-09, Vol.20 (3), p.1-24
• Main Authors: Zhao, Jin, Zhang, Yu, He, Ligang, Li, Qikun, Zhang, Xiang, Jiang, Xinyu, Yu, Hui, Liao, Xiaofei, Jin, Hai, Gu, Lin, Liu, Haikun, He, Bingsheng, Zhang, Ji, Song, Xianzheng, Wang, Lin, Zhou, Jun
• Format: Article
• Language: English
• Subjects: Computer systems organization; Parallel architectures; Special purpose systems
• ISSN: 1544-3566; 1544-3973
• DOI: 10.1145/3600091

With the increasing need for graph analysis, massive Concurrent iterative Graph Processing (CGP) jobs are usually performed on the common large-scale real-world graph. Although several solutions have been proposed, these CGP jobs are not coordinated with the consideration of the inherent dependencies in graph data driven by graph topology. As a result, they suffer from redundant and fragmented accesses of the same underlying graph dispersed over distributed platform, because the same graph is typically irregularly traversed by these jobs along different paths at the same time. In this work, we develop GraphTune, which can be integrated into existing distributed graph processing systems, such as D-Galois, Gemini, PowerGraph, and Chaos, to efficiently perform CGP jobs and enhance system throughput. The key component of GraphTune is a dependency-aware synchronous execution engine in conjunction with several optimization strategies based on the constructed cross-iteration dependency graph of chunks. Specifically, GraphTune transparently regularizes the processing behavior of the CGP jobs in a novel synchronous way and assigns the chunks of graph data to be handled by them based on the topological order of the dependency graph so as to maximize the performance. In this way, it can transform the irregular accesses of the chunks into more regular ones so that as many CGP jobs as possible can fully share the data accesses to the common graph. Meanwhile, it also efficiently synchronizes the communications launched by different CGP jobs based on the dependency graph to minimize the communication cost. We integrate it into four cutting-edge distributed graph processing systems and a popular out-of-core graph processing system to demonstrate the efficiency of GraphTune. Experimental results show that GraphTune improves the throughput of CGP jobs by 3.1 ∼ 6.2, 3.8 ∼ 8.5, 3.5 ∼ 10.8, 4.3 ∼ 12.4, and 3.8 ∼ 6.9 times over D-Galois, Gemini, PowerGraph, and Chaos, and GraphChi, respectively.