Shufeng Gong

Dr. Shufeng Gong

School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 December 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
SYSong Yu
Song Yu
SGShufeng Gong
Shufeng Gong
QTQian Tao
Qian Tao
SSSijie Shen
Sijie Shen
YZYanfeng Zhang
Yanfeng Zhang
JZJingren Zhou
Jingren Zhou
The growing volume of graph data may exhaust the main memory. It is crucial to design a disk-based graph storage system to ingest updates and analyze graphs efficiently. However, existing dynamic graph storage systems suffer from read or write amplification and face the challenge of optimizing both read and write performance simultaneously. To address this challenge, we propose LSMGraph, a novel dynamic graph storage system that combines the write-friendly LSM-tree and the read-friendly CSR. It leverages the multi-level structure of LSM-trees to optimize write performance while utilizing the compact CSR structures embedded in the LSM-trees to boost read performance. LSMGraph uses a new memory structure, MemGraph, to efficiently cache graph updates and uses a multi-level index to speed up reads within the multi-level structure. Furthermore, LSMGraph incorporates a vertex-grained version control mechanism to mitigate the impact of LSM-tree compaction on read performance and ensure the correctness of concurrent read and write operations. Our evaluation shows that LSMGraph significantly outperforms state-of-the-art (graph) storage systems on both graph update and graph analytical workloads.

21 October 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SGShufeng Gong
Shufeng Gong
YZYanfeng Zhang
Yanfeng Zhang
GYGe Yu
Ge Yu
Prioritized computation is shown promising performance for a large class of graph algorithms. It prioritizes the execution of some vertices that play important roles in determining convergence. For large-scale distributed graph processing, graph partitioning is an important preprocessing step that aims to balance workload and to reduce communication costs between workers. However, existing graph partitioning methods are designed for round-robin synchronous distributed frameworks. They balance workload without distinction of vertex importance and fail to consider the characteristics of priority-based scheduling, which may limit the benefit of prioritized graph computation. In this paper, to accelerate prioritized iterative graph computations, we propose Hotness Balanced Partition (HBP). In prioritized graph computation, high priority vertices are likely to be executed more frequently and are likely to pass more messages, which result in hot vertices. Based on this observation, we partition graph by distributing vertices with distinction according to their hotness rather than blindly distributing vertices with equal weights, aiming to evenly distribute the hot vertices among workers. We further provide two HBP algorithms: a streaming-based algorithm for efficient one-pass processing and a distributed algorithm for distributed processing. Our results show that our proposed partition methods outperform the state-of-the-art partition methods, Fennel, HotGraph and SNE.

3 September 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
FYFeng Yao
Feng Yao
QTQian Tao
Qian Tao
SLShengyuan Lin
Shengyuan Lin
YZYanfeng Zhang
Yanfeng Zhang
WYWenyuan Yu
Wenyuan Yu
JZJingren Zhou
Jingren Zhou
Iterative graph processing is widely used as a significant paradigm for large-scale data analysis. In many global businesses of multinational enterprises, graph-structure data is usually geographically distributed in different regions to support low-latency services. Geo-distributed graph processing suffers from the Wide Area Networks (WANs) with scarce and heterogeneous bandwidth, thus essentially differs from traditional distributed graph processing. In this paper, we propose RAGraph, a Region-Aware framework for geo-distributed graph processing . At the core of RAGraph, we design a region-aware graph processing framework that allows advancing inefficient global updates locally and enables sensible coordination-free message interactions and flexible replaceable communication module. In terms of graph data preprocessing, RAGraph introduces a contribution-driven edge migration algorithm to effectively utilize network resources. RAGraph also contains an adaptive hierarchical message interaction engine to switch interaction modes adaptively based on network heterogeneity and fluctuation, and a discrepancy-aware message filtering strategy to filter important messages. Experimental results show that RAGraph can achieve an average speedup of 9.7× (up to 98×) and an average WAN cost reduction of 78.5 $\%$ (up to 97.3 $\%$ ) compared with state-of-the-art systems.

20 February 2024 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
SGShufeng Gong
Shufeng Gong
CTChao Tian
Chao Tian
QYQiang Yin
Qiang Yin
ZWZhengdong Wang
Zhengdong Wang
SYSong Yu
Song Yu
JZJingren Zhou
Jingren Zhou

4 March 2025 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QWQiange Wang
Qiange Wang
XAXin Ai
Xin Ai
YYYongze Yan
Yongze Yan
SGShufeng Gong
Shufeng Gong
YZYanfeng Zhang
Yanfeng Zhang
GYGe Yu
Ge Yu
The key performance bottleneck of large-scale graph processing on memory-limited GPUs is the host-GPU graph data transfer. Existing GPU-accelerated graph processing frameworks address this issue by managing the active subgraph transfer at runtime. Some frameworks adopt explicit transfer management approaches based on explicit memory copy with filter or compaction. In contrast, others adopt implicit transfer management approaches based on on-demand accesses with the zero-copy mechanism or unified virtual memory. Having made intensive analysis, we find that as the active vertices evolve, the performance of the two approaches varies in different workloads. Due to heavy redundant data transfers, high CPU compaction overhead, or low bandwidth utilization, adopting a single approach often results in suboptimal performance. Moreover, these methods lack effective cache management methods to address the irregular and sparse memory access pattern of graph processing. In this work, we propose a hybrid transfer management approach that takes the merits of both two transfer approaches at runtime. Moreover, we present an efficient vertex-centric graph caching framework that minimizes CPU-GPU communication by caching frequently accessed graph data at runtime. Based on these techniques, we present HytGraph, a GPU-accelerated graph processing framework, which is empowered by a set of effective task-scheduling optimizations to improve performance. Experiments on real-world and synthetic graphs show that HytGraph achieves average speedups of 2.5×, 5.0×, and 2.0× compared to the state-of-the-art GPU-accelerated graph processing systems, Grus, Subway, and EMOGI, respectively.

13 June 2022 in IEEE Access
Verified
Journal Article
Open access
JDJiwen Ding
Jiwen Ding
ZLZhuojin Liu
Zhuojin Liu
YZYanfeng Zhang
Yanfeng Zhang
SGShufeng Gong
Shufeng Gong
GYGe Yu
Ge Yu
Locality-sensitive hashing (LSH) has attracted extensive research efforts for approximate nearest neighbors (NN) search. However, most of these LSH-based index structures fail to take data distribution into account. They perform well in a uniform data distribution setting but exhibit unstable performance when the data are skewed. As known, most real life data are skewed, which makes LSH suffer. In this paper, we observe that the skewness of hash values resulted from skewed data is a potential reason for performance degradation. To address this problem, we propose to rebuild LSH indices by exploring the density of hash values. The hash values in dense/sparse ranges are carefully reorganized using a multi-layered structure, so that more efforts are put into indexing the dense hash values. We further discuss the benefit in distributed computing. Extensive experiments are conducted to show the effectiveness and efficiency of the reconstructed LSH indices.