[1] AYALL T A, LIU H, ZHOU C, et al. Graph
Computing Systems and Partitioning Techniques:
A Survey[J]. IEEE Access, 2022, 10:
118523-118550.
[2] LIU N, LI D sheng, ZHANG Y ming, et al.
Large-scale graph processing systems: a survey[J].
FRONTIERS OF INFORMATION
TECHNOLOGY & ELECTRONIC
ENGINEERING, 2020, 21(3): 384-404.
[3] MAZAHERI SOUDANI N, FATEMI A,
NEMATBAKHSH M. An investigation of big
graph partitioning methods for distribution of
graphs in vertex-centric systems[J].
DISTRIBUTED AND PARALLEL DATABASES,
2020, 38(1): 1-29.
[4] GHOSH S, DAS N, GONCALVES T, et al. The
journey of graph kernels through two decades[J].
COMPUTER SCIENCE REVIEW, 2018, 27:
88-111.
[5] Gui C Y, Zheng L, He B, et al. A survey on graph
processing accelerators: Challenges and
opportunities[J]. Journal of Computer Science
and Technology, 2019, 34: 339-371.
[6] Gonzalez J E, Low Y, Gu H, et al. Powergraph:
Distributed graph-parallel computation on natural
graphs[C]//In Proceedings of the 10th USENIX
Conference on Operating Systems Design and
Implementation. USA: USENIX Association,
2012: 17-30.
[7] Aridhi S, Montresor A, Velegrakis Y. BLADYG:
A graph processing framework for large dynamic
graphs[J]. Big Data Research, 2017, 9: 9-17.
[8] Fan W, He T, Lai L, et al. GraphScope: a unified
engine for big graph processing[J]. Proceedings
of the VLDB Endowment, 2021, 14(12):
2879-2892.
[9] Shi X, Zheng Z, Zhou Y, et al. Graph processing
on GPUs: A survey[J]. ACM Computing Surveys
(CSUR), 2018, 50(6): 1-35.
[10] Zhang T, Zhang J, Shu W, et al. Efficient graph
computation on hybrid CPU and GPU systems[J].
The Journal of Supercomputing, 2015, 71:
1563-1586.
[11] Jia Z, Kwon Y, Shipman G, et al. A distributed
multi-gpu system for fast graph processing[J].
Proceedings of the VLDB Endowment, 2017,
11(3): 297-310.
[12] Yangzihao Wang, Yuechao Pan, Andrew Davidson,
et al. Gunrock: GPU Graph Analytics[J]. ACM
Trans. 2017,4: 2329-4949.
[13] Zhou S, Kannan R, Prasanna V K, et al. Hitgraph:
High-throughput graph processing framework on
fpga[J]. IEEE Trans on Parallel and Distributed
Systems, 2019, 30(10): 2249-2264.
[14] Miao X, Ma L, Yang Z, et al. Cuwide: Towards
efficient flow-based training for sparse wide
models on gpus[J]. IEEE Trans on Knowledge
and Data Engineering, 2020, 34(9): 4119-4132.
[15] Zhu H, He L, Leeke M, et al. WolfGraph: The
edge-centric graph processing on GPU[J]. Future
Generation Computer Systems, 2020, 111:
552-569.
[16] Wang P, Wang J, Li C, et al. Grus: Toward
unified-memory-efficient high-performance graph
processing on gpu[J]. ACM Transactions on
Architecture and Code Optimization (TACO),
2021, 18(2): 1-25.
[17] Zhang Y, Peng D, Liao X, et al. LargeGraph: An
efficient dependency-aware GPU-accelerated
large-scale graph processing[J]. ACM
Transactions on Architecture and Code
Optimization (TACO), 2021, 18(4): 1-24.
[18] Yang C, Buluç A, Owens J D. GraphBLAST: A
high-performance linear algebra-based graphframework on the GPU[J]. ACM Transactions on
Mathematical Software (TOMS), 2022, 48(1):
1-51.
[19] 蒋筱斌, 熊轶翔, 张珩, 等. ChattyGraph: 面向
异构多协处理器环境的高可扩展图计算系统[J].
软件学报, 2023, 34(4):1977-1996 (Jiang Xiaobin,
Xiong Yixiang, Zhang Heng, et al. ChattyGraph:
Highly Scalable Graph Computing System for
Heterogeneous Multi Accelerators[J]. Journal of
Software. 2023, 34(4):1977-1996)
[20] Wenfei Fan, Jingbo Xu, Yinghui Wu, et al. 2017.
Parallelizing Sequential Graph Computations[C].
//In Proceedings of the 2017 ACM International
Conference on Management of Data (SIGMOD
'17). Association for Computing Machinery, New
York, NY, USA, 495–510.
[21] 钱裳云, 邵志远, 郑然, 陈继林. 图数据库中基
于 GPU 的图分析计算方法[J]. 计算机工程,
2021, 47(6): 52-59. (QIAN Shangyun, SHAO
Zhiyuan, ZHENG Ran, CHEN Jilin. GPU-based
Graph Analysis and Computation Method for
Graph Database[J]. Computer Engineering, 2021,
47(6): 52-59.)
[22] 王晓峰, 于卓, 赵健, 曹泽轩. 大规模图例的最
大团问题算法分析[J]. 计算机工程, 2022, 48(6):
182-192,199. (WANG Xiaofeng, YU Zhuo,
ZHAO Jian, CAO Zexuan. Algorithm Analysis
for Solving Maximum Clique Problems of
Large-scale Graphs[J]. Computer Engineering,
2022, 48(6): 182-192,199.)
[23] HUANG J, WANG H, FEI X, et al. TCStream:
Large-Scale Graph Triangle-Counting on a single
Machine using GPUs[J]. IEEE Trans on Parallel
and Distributed Systems, 2022, 33:3067-3078
[24] Page L , Brin S , Motwani R ,et al. The PageRank
Citation Ranking: Bringing Order to the Web[J].
Stanford Digital Libraries Working Paper, 1998.
[25] Jure Leskovec and Andrej Krevl. SNAP Datasets:
Stanford Large Network Dataset Collection
[EB/OL]. [2014-6]. http://snap.stanford.edu/data
[26] Feng X, Chang L, Lin X, et al. Distributed
computing connected components with linear
communication cost[J]. Distributed and Parallel
Databases, 2018, 36: 555-592.
[27] Maleki S, Nguyen D, Lenharth A, et al. DSMR: a
shared and distributed memory algorithm for
single-source shortest path problem[C] //the 21st
ACM SIGPLAN Symposium.ACM, 2016,
39:1-2.
[28] Batagelj V, Zaversnik M. An O(m) Algorithm for
Cores Decomposition of Networks[J]. Arxiv,
2002.
[29] J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney.
Community Structure in Large Networks: Natural
Cluster Sizes and the Absence of Large
Well-Defined Clusters[J]. Internet Mathematics,
2009,6(1): 29-123.
|