SparseMEM
Energy-efficient Design for In-memory Sparse-based Graph Processing
Mahdi Zahedi (TU Delft - Computer Engineering)
Geert Custers (Student TU Delft)
Taha Shahroodi (TU Delft - Computer Engineering)
Georgi Gaydadjiev (TU Delft - Computer Engineering, TU Delft - Quantum Circuit Architectures and Technology)
Stephan Wong (TU Delft - Computer Engineering)
Said Hamdioui (TU Delft - Quantum & Computer Engineering)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Performing analysis on large graph datasets in an energy-efficient manner has posed a significant challenge; not only due to excessive data movements and poor locality, but also due to the non-optimal use of high sparsity of such datasets. The latter leads to a waste of resources as the computation is also performed on zero's operands which do not contribute to the final result. This paper designs a novel graph processing accelerator, SparseMEM, targeting sparse datasets by leveraging the computing-in-memory (CIM) concept; CIM is a promising solution to alleviate the overhead of data movement and the inherent poor locality of graph processing. The proposed solution stores the graph information in a compressed hierarchical format inside the memory and adjusts the workflow based on this new mapping. This vastly improves resource utilization, leading to higher energy and permanence efficiency. The experimental results demonstrate that SparseMEM outperforms a GPU-based platform and two state-of-the-art in-memory accelerators on speedup and energy efficiency by one and three orders of magnitude, respectively.