Cacheap:Portable and Collaborative I/O Optimization for Graph Processing  

作　　者：Peng Zhao Chen Ding Lei Liu Jiping Yu Wentao Han Xiao-Bing Feng 

机构地区：[1]State Key Laboratory of Computer Architecture,Institute of Computing Technology,Chinese Academy of Sciences Beijing 100190,China [2]University of Chinese Academy of Sciences,Beijing 100049,China [3]Department of Computer Science,University of Rochester,Rochester 14623,U.S.A. [4]Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China

出　　处：《Journal of Computer Science & Technology》2019年第3期690-706,共17页计算机科学技术学报（英文版）

基　　金：the National Key Research and Development Program of China under Grant No.2017YFB1003103;the National Natural Science Foundation of China under Grant Nos.6143201&61432016,61332009,and 61521092;the National Science Foundation of USA under Contract Nos.CCF-1717877 and CCF-1629376;an IBM CAS Faculty Fellowship.

摘　　要：Increasingly there is a need to process graphs that are larger than the available memory on today's machines.Many systems have been developed with grapli representations that are efficient and compact for out-of-core processing.A necessary task in these systems is memory management.This paper presents a system called Cacheap which automatically and efficiently manages the available memory to maximize the speed of grapli processing,minimize the amount of disk access,and maximize the utilization of memory for graph data.It has a simple interface that can be easily adopted by existing graph engines.The paper describes the new system,uses it in recent graph engines,and demonstrates its integer factor improvements in the speed of large-scale grapli processing.

关 键 词：OUT-OF-CORE GRAPH processing system I/O optimization memory CACHE GRAPH ANALYTICS LOCALITY 

分 类 号：TP[自动化与计算机技术]