Skip to content
Open access

DCSR-GCN: A High-Performance GCN Accelerator Based on Dynamic Compression and Sparsity Reordering

Sep 2026 · ACM Transactions on Design Automation of Electronic Systems · 0 citations · 41 references

TL;DR

DCSR-GCN, a high-performance GCN accelerator based on dynamic compression and sparsity reordering based on dynamic compression and sparsity reordering, is presented and a two-phase reordering algorithm that combines conflict-aware row scheduling with reuse-aware column grouping is proposed, thereby mitigating RAW conflicts and improving memory access efficiency is proposed.

Abstract

Graph Convolutional Networks (GCNs) are widely used in tasks involving irregular graph data, such as recommendation. The hybrid execution pattern of sparse aggregation and dense combination during inference limits the efficiency of general processors like CPU and GPU. Therefore, designing dedicated accelerators for GCN inference has become an important research direction. However, existing GCN accelerators still suffer from high storage overhead caused by sparse indices and frequent read-after-write (RAW) conflicts during the aggregation phase, which limit system throughput and energy efficiency. To address these challenges, we adopt the hardware-software co-design approach and present DCSR-GCN, a high-performance GCN accelerator based on dynamic compression and sparsity reordering. First, we design an Enhanced Compressed Sparse Row (ECSR) format to reduce adjacency index storage space, and directly embed node degree fields to eliminate redundant computations in aggregation. Second, we propose a two-phase reordering algorithm that combines conflict-aware row scheduling with reuse-aware column grouping, thereby mitigating RAW conflicts and improving memory access efficiency. Finally, to fully exploit the benefits of sparse optimizations, we design a high-throughput vector systolic array that accelerates feature transformation in combination. Evaluations show that DCSR-GCN achieves up to 26.03 ×, 4.19 ×, and 3.52 × speedup compared to HyGCN, GCNAX, and MEGA, respectively.

Read PDF

Similar papers

Open access Oct 2026

ADEM: Accelerating Sparse Matrix Multiplication with Adaptive Dataflow and Efficient Merging

This work proposes the segmented fiber tree (SFT) data structure, which extends the conventional fiber tree through further partitioning to better support the dataflow paradigm while enhancing data reuse, and decouples the multiplication and merging phases.

Sheng-Bai Luo, Sheng Ma, Bo Wang et al. · 0 citations
Open access Sep 2026

G-CasDec: General Cascaded Decompression on GPUs

G-CasDec is presented, an optimized framework to enable efficient decompression on GPUs for general cascaded compression schemes that outperforms state-of-the-art designs with 2.8× higher compression ratios and 2.0× faster decompression, and is also extensible to arbitrary cascade schemes.

Yong-Qi Zhuo, Xin-Yu Zeng, Huan-Chen Zhang et al. · 0 citations
#edge computing Open access Sep 2026

SATLLM: A Sparsity-aware Accelerator for Ternary-Weight Large Language Models

Large language models (LLMs) exhibit strong performance across applications, but their inference is computationally intensive, posing significant challenges for edge deployment. Quantization is among the most effective and widely used optimizations. In particular, ternary-weight quantization further lowers compute cost...

Chang-Xu Liu, Yi-Fan Song, Yi-Feng Yang et al. · 0 citations
Book Open access Sep 2026

CoTC-SpMM: A Cooperative Tensor–CUDA Cores Scheme for Efficient Sparse Matrix Multiplication

CoTC-SpMM is introduced, a cooperative Tensor–CUDA cores scheme for efficient SpMM on GPUs that first proposes the HTC format to partition sparse matrices into dense and sparse components, enabling specialized kernels to leverage the distinct advantages of different computing units and maximize hardware utilization.

Qi Du, Sheng-Le Lin, Yue-Dan Chen et al. · 0 citations
Sep 2026

FastPair: GPU-Optimized String Decoding

FastPair is presented, a GPU decoder that optimizes the existing dictionary decoding process by reorganizing lookups and assembling decoded substrings for contiguous output writes, reaching up to 1.6 TB/s on a B300.

J. Isaacs, Francesco Gargiulo, P. Boncz et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.