Skip to content

SPP-GCN: An Efficient GCN Accelerator Under Low Memory Footprint

Sep 2026 · IEEE Transactions on Very Large Scale Integration (vlsi) Systems · Vol 34, pp. 2807-2817 · 0 citations · 25 references

Abstract

Graph convolutional networks (GCNs) have demonstrated strong capability in modeling graph-structured data and have been widely adopted in various industrial applications. With the rapid growth of edge computing, designing GCN accelerators that maintain high performance under strict resource constraints has become increasingly important. This article presents SPP-GCN, a hardware–software co-optimized accelerator that significantly improves memory efficiency (ME) while maintaining competitive performance. SPP-GCN introduces four hardware–software co-optimization strategies—shuffle, z-merge, concatenation, and preplanning cache—to leverage software-side preprocessing and enhance the graph awareness of the hardware execution pipeline. These techniques effectively improve processing-element utilization and reduce on-chip memory footprint. Evaluated on both GCN and GraphSAGE models across multiple benchmark datasets, SPP-GCN achieves up to $86.9\times $ and $18.85\times $ latency reductions compared with CPU and GPU implementations, respectively. Compared with a prior lightweight accelerator, LW-GCN, SPP-GCN further reduces on-chip memory consumption by 58.5% while achieving up to $1.27\times $ higher relative performance (RP) under the adopted CE/RP-normalized comparison methodology. In addition, although several existing field-programmable gate array (FPGA) accelerators (e.g., BoostGCN, FP-GNN, and Graph-OPU) provide competitive latency, they require significantly larger on-chip memory resources. To better characterize performance density under resource constraints, we further introduce a ME metric that quantifies the RP achieved per unit of on-chip memory. Experimental results show that SPP-GCN consistently achieves the highest ME under the proposed ME metric among the evaluated FPGA-based GCN accelerators. These results demonstrate that the proposed hardware–software co-optimization framework effectively balances performance and resource utilization, making SPP-GCN particularly suitable for memory-constrained edge platforms.

View source

Similar papers

Open access Aug 2026

HyST-DNA: Hybrid SRAM-TCAM DNN accelerator with genetic optimization on FPGA

This work proposes a hybrid SRAM-TCAM memory-centric deep neural network (DNN) architecture that integrates three tightly coupled subsystems and provides O(1) parallel associative inference.

Vandana Thakur, V. More, Abhishek Bhatt · 0 citations
Jul 2026

A Reconfigurable and Representation-Adaptive ISA-Based Architecture for Efficient DNN Acceleration

The proposed ISA enables fine-grained control over data movement, dynamic precision, and decoupled execution across data-fetching, tensor processing, and post-processing domains and outperforms state-of-the-art and mixed-precision accelerators.

Vasilis Sakellariou, Vassilis Paliouras, I. Kouretas et al. · 0 citations
Book Open access Aug 2026

Tris-GCN: A 3D NAND Flash-based In-Storage Processing Architecture for GCN Acceleration

Graph convolutional networks (GCNs) excel in many applications, but scaling to large graphs is bottlenecked by heavy data movement. Existing in-storage processing (ISP) solutions offload I/O-intensive operations to the SSD controller to reduce PCIe traffic, but limited parallelism and flash bandwidth still constrain en...

Yi-Wa Wu, Jia-You Li, Chi-Jung Chen et al. · 0 citations
Review Aug 2026

AI Hardware Accelerators for Large Language Models: Architectures and the Memory Wall

This review surveys the full landscape of AI hardware accelerators for LLMs, including general-purpose GPUs, custom ASICs, reconfigurable FPGAs, processing-in-memory and near-memory architectures, and emerging neuromorphic and photonic approaches across cloud and edge deployment.

Siddharth Patel, Rohit Singh · 0 citations
Open access Aug 2026

Hardware-level data layout approach to mitigate the memory row conflicts on FPGA-based CNN accelerators

A hardware-level data layout technique using a memory-centric accelerator architecture that improves memory performance in FPGA-based CNN accelerators in a scalable and hardware-efficient manner without requiring a large computational burden.

S. Prasad, Suman Jayakumar, Bellary Kursheed et al. · 0 citations
Book Open access Jul 2026

SPPO: Making Million-Token LLM Training Practical on Modest GPU Clusters

Adaptive Sequence Pipeline Parallel Offloading (SPPO) is proposed, a novel framework that optimizes memory and computational resource efficiency for long-sequence LLM training and develops an adaptive pipeline scheduling approach with a heuristic solver and multiplexed sequence partitioning to improve computational res...

Qiaoling Chen, Shenggui Li, Wei Gao et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

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