Graph convolutional neural networks (GCNs) have emerged as a key technology in various application domains where the input data is relational. A unique property of GCNs is that its two primary execution stages, aggregation and combination, exhibit drastically different dataflows. Consequently, prior GCN accelerators tackle this research space by casting the aggregation and combination stages as a series of sparse-dense matrix multiplication. However, prior work frequently suffers from inefficient data movements, leaving significant performance left on the table. We present GROW, a GCN accelerator based on Gustavson's algorithm to architect a row-wise product based sparse-dense GEMM accelerator. GROW co-designs the software/hardware that strikes a balance in locality and parallelism for GCNs, achieving significant energy-efficiency improvements vs. state-of-the-art GCN accelerators.
翻译:GCN的独特特性是,它的两个初级执行阶段,即聚合和组合,呈现出截然不同的数据流。因此,以前的GCN加速器将聚合和组合阶段作为一连串稀薄热量矩阵乘法,从而解决了这一研究空间的问题。然而,先前的工作经常受到数据流动效率低下的困扰,留下显著的性能。我们介绍了GROW,这是一个基于古斯塔夫森算法的GCN加速器,用来设计一个以稀有密度GEMM加速器为基础的行式产品。GROW共同设计了软件/硬件,为GCNS在地点和平行关系上取得平衡,实现了显著的能源效率提高和高科技GCN加速器的状态。