Shi Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shi Chen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Li Shen
National University of Defense Technology
3 shared publications - Junsheng Chang
National University of Defense Technology
2 shared publications - Yang Guo
National University of Defense Technology
2 shared publications - Chaoyang Jia
National University of Defense Technology
1 shared publication - Jingyu Liu
National University of Defense Technology
1 shared publication - Kai Lu
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 13 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (4) , 1-24
PipeGNN: A Bandwidth-Efficient GNN Accelerator with Node-Level Pipelined Push Execution
Graph Neural Networks (GNNs) have become a fundamental tool for learning over graph-structured data. Under the message-passing framework, mainstream GNN models alternate between feature transformation and neighborhood aggregation. Fusing these two phases into a node-level pipelined push dataflow, in which each node’s transformed feature streams directly into aggregation, establishes a single-pass I/O target that reads each input tensor exactly once per layer. No existing hardware sustains this dataflow at full concurrency. Prior fusion accelerators fall short of this target in three ways: designs that gather the raw input features for aggregation or write transformed features off-chip incur redundant traffic, designs that stream transformed features on-chip still keep the two phases as separate matrix kernels without a unified execution granularity, and the designs that aggregate at message granularity serialize per-destination aggregation or allocate state that does not scale to large graphs. We propose PipeGNN, a bandwidth-efficient GNN accelerator whose streaming microarchitecture sustains this dataflow as a fully concurrent pipeline within a fixed on-chip buffer budget. PipeGNN decouples execution from topological boundaries by aligning execution granularity with both memory burst size and aggregation compute throughput, and resolves four coupled microarchitectural barriers through coordinated mechanisms: compute-aligned edge batching, contention-aware message reduction, adaptive cross-batch scheduling, and tiered state residency. Evaluated across diverse GNN workloads, PipeGNN achieves geometric mean speedups of 10.1× over AWB-GCN and 12.2× over FlowGNN, and 2.4× to 46.9× over a GPU baseline across graph scales, reduces off-chip traffic by 2.69× over AWB-GCN and 5.93× over FlowGNN, and improves energy efficiency by 56.81× over AWB-GCN and 1.53× over FlowGNN, with a 154× traffic reduction and a 116.81× energy reduction against HyGCN.
- 13 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (4) , 1-24
Open AccessPipeGNN: A Bandwidth-Efficient GNN Accelerator with Node-Level Pipelined Push Execution
Graph Neural Networks (GNNs) have become a fundamental tool for learning over graph-structured data. Under the message-passing framework, mainstream GNN models alternate between feature transformation and neighborhood aggregation. Fusing these two phases into a node-level pipelined push dataflow, in which each node’s transformed feature streams directly into aggregation, establishes a single-pass I/O target that reads each input tensor exactly once per layer. No existing hardware sustains this dataflow at full concurrency. Prior fusion accelerators fall short of this target in three ways: designs that gather the raw input features for aggregation or write transformed features off-chip incur redundant traffic, designs that stream transformed features on-chip still keep the two phases as separate matrix kernels without a unified execution granularity, and the designs that aggregate at message granularity serialize per-destination aggregation or allocate state that does not scale to large graphs. We propose PipeGNN, a bandwidth-efficient GNN accelerator whose streaming microarchitecture sustains this dataflow as a fully concurrent pipeline within a fixed on-chip buffer budget. PipeGNN decouples execution from topological boundaries by aligning execution granularity with both memory burst size and aggregation compute throughput, and resolves four coupled microarchitectural barriers through coordinated mechanisms: compute-aligned edge batching, contention-aware message reduction, adaptive cross-batch scheduling, and tiered state residency. Evaluated across diverse GNN workloads, PipeGNN achieves geometric mean speedups of 10.1× over AWB-GCN and 12.2× over FlowGNN, and 2.4× to 46.9× over a GPU baseline across graph scales, reduces off-chip traffic by 2.69× over AWB-GCN and 5.93× over FlowGNN, and improves energy efficiency by 56.81× over AWB-GCN and 1.53× over FlowGNN, with a 154× traffic reduction and a 116.81× energy reduction against HyGCN.
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 290-298
Row-wise Inter-Phase Pipelining for Hardware-Efficient GCN Acceleration
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 290-298
Open AccessRow-wise Inter-Phase Pipelining for Hardware-Efficient GCN Acceleration
- Open Access
- 30 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (2) , 1-26
TSN Cache: Exploiting Data Localities in Graph Computing Applications
This article finds that the reusability of vertices in the same graph in graph processing differs, and the high-reuse and low-reuse vertices are stored together. These phenomena lead to the inability of existing GPU architectures to capture the reusability of graph processing. The most advanced cache optimization strategies cannot implement different management strategies for data with different reusability, which is an essential reason for graph processing’s poor performance. Therefore, we propose a TSN cache scheme for the GPU platform. This scheme employs distinct management strategies for data with varying reusability in the cache, effectively leveraging the locality of these different data types. In addition, the TSN cache scheme can also reduce the probability of cache thrashing caused by low-reuse data. This article evaluates multiple graph algorithms and datasets and shows that the TSN cache scheme achieves an average speedup of 1.38 compared with the baseline scheme.
- 30 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (2) , 1-26
Open AccessTSN Cache: Exploiting Data Localities in Graph Computing Applications
This article finds that the reusability of vertices in the same graph in graph processing differs, and the high-reuse and low-reuse vertices are stored together. These phenomena lead to the inability of existing GPU architectures to capture the reusability of graph processing. The most advanced cache optimization strategies cannot implement different management strategies for data with different reusability, which is an essential reason for graph processing’s poor performance. Therefore, we propose a TSN cache scheme for the GPU platform. This scheme employs distinct management strategies for data with varying reusability in the cache, effectively leveraging the locality of these different data types. In addition, the TSN cache scheme can also reduce the probability of cache thrashing caused by low-reuse data. This article evaluates multiple graph algorithms and datasets and shows that the TSN cache scheme achieves an average speedup of 1.38 compared with the baseline scheme.