检索结果-南通市图书馆

A disk i/o optimized system for concurrent graph processing jobs

Frontiers of Computer Science 2024年第3期18卷 13-29页

作者： Xianghao XU Fang WANG Hong JiANG Yongli CHENG Dan FENG Peng FANG School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210094China Wuhan National Laboratory for optoelectronics Huazhong University of Science and TechnologyWuhan 430074China Department of Computer Science&Engineering University of Texas at ArlingtonArlingtonTX 76019USA College of Computer and Data Science Fuzhou UniversityFuzhou 350108China Zhejiang Lab Hangzhou 311121China

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 *** 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)***,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 *** this paper,we propose GraphCP,a disk i/o optimized out-of-core graph processing system that efficiently supports the processing of CGP *** 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 ***,GraphCP adopts a dependency-based future-vertex updating model so as to reduce disk i/os in the future *** addition,GraphCP organizes the graph data with a Source-Sorted Sub-Block graph representation for better processing capacity and i/o access *** evaluation results show that GraphCP is 20.5×and 8.9×faster than two out-of-core graph processing systems GridGraph and GraphZ,and 3.5×and 1.7×faster than two state-of-art concurrent graph processing systems Seraph and GraphSo.

关键词： graph processing disk i/o concurrent jobs

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：