.png){kind=icon}
返回
A disk I/O optimized system for concurrent graph processing jobs
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-023-2361-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In order to analyze and process the large graphs with high cost efficiency, researchers have developed a number of out-of-core graph processing systems in recent years based on just one commodity computer. On the other hand, with the rapidly growing need of analyzing graphs in the real-world, graph processing systems have to efficiently handle massive concurrent graph processing (CGP) jobs. Unfortunately, due to the inherent design for single graph processing job, existing out-of-core graph processing systems usually incur unnecessary data accesses and severe competition of I/O bandwidth when handling the CGP jobs. In this paper, we propose GraphCP, a disk I/O optimized out-of-core graph processing system that efficiently supports the processing of CGP jobs. GraphCP proposes a benefit-aware sharing execution model to share the I/O access and processing of graph data among the CGP jobs and adaptively schedule the graph data loading based on the states of vertices, which efficiently overcomes above challenges faced by existing out-of-core graph processing systems. Moreover, GraphCP adopts a dependency-based future-vertex updating model so as to reduce disk I/Os in the future iterations. In addition, GraphCP organizes the graph data with a Source-Sorted Sub-Block graph representation for better processing capacity and I/O access locality. Extensive evaluation results show that GraphCP is 20.5x and 8.9x faster than two out-of-core graph processing systems GridGraph and GraphZ, and 3.5x and 1.7x faster than two state-of-art concurrent graph processing systems Seraph and GraphSO.
Keyword:
graph processing
disk I/O
concurrent jobs
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
.png){kind=icon}
查看更多内容