收藏切换
Parallel Streaming Graph Processing with Hybrid Incremental Computation
收藏切换
Yue Shen1, 2, 3, Jie Zhang1, Yuan Zhang1, *, Huawei Cao1, 2, 3, Xuejun An1, 2, 3, Xiaochun Ye1
Journal of Computer Research and Development | 2026, 63(3) : 798 - 811
Less
收藏切换
Journal of Computer Research and Development | 2026, 63(3): 798-811
• High Performance Computing •
Parallel Streaming Graph Processing with Hybrid Incremental Computation
Full
Yue Shen1, 2, 3, Jie Zhang1, Yuan Zhang1, *, Huawei Cao1, 2, 3, Xuejun An1, 2, 3, Xiaochun Ye1
Affiliations
  • 1State Key Laboratory of Processors (Institute of Computing Technology, Chinese Academy of Sciences), Beijing 100190
  • 2University of Chinese Academy of Sciences, Beijing 100049
  • 3Zhongguancun Laboratory, Beijing 100094
  • born in 1999. PhD candidate. Member of CCF. Her main research interests include parallel computing and dynamic graph processing

    born in 1999. Master, assistant engineer. Her main research interests include high-performance computing and graph algorithm optimization

    born in 1990. PhD, engineer. Member of CCF. Her main research interests include high-performance computing and graph algorithm optimization

    born in 1989. PhD, associate professor, master supervisor. Member of CCF. His main research interests include parallel computing and high throughput computing architecture

    born in 1966. PhD, senior engineer, PhD supervisor. Member of CCF. His main research interests include computer system architecture and high-performance interconnection networks

    born in 1981. PhD, professor, PhD supervisor. Member of CCF. His main research interests include algorithm paralleling and optimizing software simulation, and architecture for high throughput computer

About Author:

born in 1999. PhD candidate. Member of CCF. Her main research interests include parallel computing and dynamic graph processing

born in 1999. Master, assistant engineer. Her main research interests include high-performance computing and graph algorithm optimization

born in 1990. PhD, engineer. Member of CCF. Her main research interests include high-performance computing and graph algorithm optimization

born in 1989. PhD, associate professor, master supervisor. Member of CCF. His main research interests include parallel computing and high throughput computing architecture

born in 1966. PhD, senior engineer, PhD supervisor. Member of CCF. His main research interests include computer system architecture and high-performance interconnection networks

born in 1981. PhD, professor, PhD supervisor. Member of CCF. His main research interests include algorithm paralleling and optimizing software simulation, and architecture for high throughput computer

Published: 2026-03-01 doi: 10.7544/issn1000-1239.202550151
Outline
收藏切换

Streaming graphs can effectively model rapidly changing data in real life, and have been widely used in social network analysis, content recommendation, anomaly detection, and other fields. Based on the fact that the two graph snapshots before and after the graph update have a large amount of the same data, incremental computation reduces the amount of memory accesses and computation in the iterations by storing and reusing the historical results, which effectively improves the performance of streaming graph processing. However, the existing solutions for incremental computation optimization of graph algorithms are often limited by graph algorithms that satisfy specific properties, thus it is difficult to apply them to general graph algorithms. In this paper, the incremental computation is further divided into two modes of refinement and recomputation. The similarities and differences between the two modes are analyzed theoretically, and the performance differences between them are tested experimentally with different datasets, algorithms, and update settings. Based on the two modes, the hybrid incremental computation mode is designed to ensure the correctness of switching, and the switching time is predicted accurately by random forest classifiers. Through performance evaluation and switching effect analysis, it is proved that the general graph algorithms can effectively switch under the hybrid mode. Compared with the state-of-the-art solution DZIG, the average speedup is 1.25.

streaming graphs  /  incremental computation  /  dynamic graph processing  /  graph algorithms  /  parallel processing  /  graph processing systems
申玥, 张婕, 张园, 曹华伟, 安学军, 叶笑春. 基于混合增量计算的流式图并行处理. 计算机研究与发展, 2026 , 63 (3) : 798 -811 . DOI: 10.7544/issn1000-1239.202550151
Yue Shen, Jie Zhang, Yuan Zhang, Huawei Cao, Xuejun An, Xiaochun Ye. Parallel Streaming Graph Processing with Hybrid Incremental Computation[J]. Journal of Computer Research and Development, 2026 , 63 (3) : 798 -811 . DOI: 10.7544/issn1000-1239.202550151
Year 2026 volume 63 Issue 3
217
95
Cite this Article
BibTeX
Article Info
doi: 10.7544/issn1000-1239.202550151
  • Receive Date:2025-03-01
  • Online Date:2026-11-06
  • Published:2026-03-01
Article Data
Affiliations
History
  • Received:2025-03-01
  • Revised:2025-09-08
  • Accepted:2025-10-11
Affiliations
    1State Key Laboratory of Processors (Institute of Computing Technology, Chinese Academy of Sciences), Beijing 100190
    2University of Chinese Academy of Sciences, Beijing 100049
    3Zhongguancun Laboratory, Beijing 100094
References
Share
https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202550151
Share to
QR

Scan QR to access full text

Cite this article
BibTeX
Citations
表12种不同金属材料的力学参数
科
Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)
属
Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏
  • BibTeX
  • EndNote
  • RefWorks
  • TxT