English

GCN-ABFT: Low-Cost Online Error Checking for Graph Convolutional Networks

Hardware Architecture 2024-12-25 v1 Machine Learning

Abstract

Graph convolutional networks (GCNs) are popular for building machine-learning application for graph-structured data. This widespread adoption led to the development of specialized GCN hardware accelerators. In this work, we address a key architectural challenge for GCN accelerators: how to detect errors in GCN computations arising from random hardware faults with the least computation cost. Each GCN layer performs a graph convolution, mathematically equivalent to multiplying three matrices, computed through two separate matrix multiplications. Existing Algorithm-based Fault Tolerance(ABFT) techniques can check the results of individual matrix multiplications. However, for a GCN layer, this check should be performed twice. To avoid this overhead, this work introduces GCN-ABFT that directly calculates a checksum for the entire three-matrix product within a single GCN layer, providing a cost-effective approach for error detection in GCN accelerators. Experimental results demonstrate that GCN-ABFT reduces the number of operations needed for checksum computation by over 21% on average for representative GCN applications. These savings are achieved without sacrificing fault-detection accuracy, as evidenced by the presented fault-injection analysis.

Keywords

Cite

@article{arxiv.2412.18534,
  title  = {GCN-ABFT: Low-Cost Online Error Checking for Graph Convolutional Networks},
  author = {Christodoulos Peltekis and Giorgos Dimitrakopoulos},
  journal= {arXiv preprint arXiv:2412.18534},
  year   = {2024}
}

Comments

Accepted for publication at IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD)

R2 v1 2026-06-28T20:48:13.680Z