Oct 2026· ACM Transactions on Architecture and Code Optimization (TACO)· 0 citations· 64 references
TL;DR
ReHGNN is presented, the first hybrid digital/analog PIM architecture for HGNN inference, and a greedy heuristic algorithm is proposed to further improve the utilization of ReRAM resource.
Abstract
Resistive random access memory (ReRAM) based analog processing-in-memory (APIM) architectures have been extensively explored for accelerating matrix multiplication in various artificial neural networks (ANNs). However, since the emerging hypergraph neural network (HGNN) generally encompasses large and highly-sparse weight matrices, they usually results in a significant waste of ReRAM resource for zero values when HGNNs are processed with APIM. This paper presents ReHGNN, the first hybrid digital/analog PIM architecture for HGNN inference. We abstract most operations in the aggregation phase of HGNN as sparse-dense matrix multiplication (SpMM), and explore a digital PIM (DPIM) to accelerate these SpMMs. First, we map only non-zero values of sparse matrices to DPIM arrays compactly to minimize the ReRAM resource consumption while improving computational parallelism. Second, we exploit heterogeneous crossbar arrays to accommodate the irregular distribution of sparse matrices. Third, we propose a greedy heuristic algorithm to further improve the utilization of ReRAM resource. Experimental results show that ReHGNN can improve the performance of HGNN inference by a factor of 3.4, 9.2, 15.3, 31.4, 41.3, and improve energy efficiency by a factor of 4.6, 14.1, 17.2, 363.8, and 473.4, compared with ReGNN, ReGraphX, FloatPIM, Hypergef, and GPUs, respectively.
The growing memory demands of artificial neural networks pose a major challenge for energy-efficient computing, particularly for models that rely on large collections of high-dimensional weight and embedding vectors. Conventional memory architectures store these vectors individually, requiring many memory cells per vec...
A. Vasilopoulos, Patrick Diener, M. Hersche et al.· 0 citations
Sparse attention mechanisms have become increasingly important for transformer models processing long input sequences due to their lower computational and memory complexity compared to full self-attention. Longformer achieves this through a sliding-window attention mechanism that produces a structured banded sparse att...
Phillip Pramberger, Athanasios Tziouvaras, Shreejith Shanker et al.· 0 citations
Sparse linear algebra is a fundamental workload in scientific computing and machine learning, but its performance is severely constrained by memory bandwidth. Processing-in-memory (PIM) has shown great potential for sparse linear algebra, yet its efficiency is heavily bottlenecked by irregular computation and memory ac...
Rui Liu, Xiao-Yu Zhang, Bo-Wen Liu et al.· Proceedings of the 32nd ACM...· 0 citations
Autoregressive decoding of large language models (LLMs) on edge devices is dominated by memory-bound general matrix--vector multiplication (GeMV) operations. Processing-using-DRAM (PUD) is a promising computing paradigm that can alleviate this bottleneck by reducing processor--memory data transfers and enabling massive...
Kevin Xu, Tatsuya Kubo, Daichi Tokuda et al.· 0 citations
Memory bandwidth is the binding constraint for large-model inference today. In-memory computing (IMC) addresses this limitation. This paper reviews where the technology stands. It compares analog and digital IMC implementations and find that analog arrays currently lead on energy efficiency, while digital designs maint...
Tian-Hao Gui· Applied and Computational En...· 0 citations
Modern artificial intelligence is predominantly executed on computing architectures optimized for dense linear algebra. While this has enabled the success of contemporary neural networks and motivated compute-in-memory (CIM) architectures, a growing class of artificial intelligence (AI) workloads depends on associative...
Paul-Philipp Manea, Bo Wen, Pei-Yi He 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.