SPA-GCN: Efficient and Flexible GCN Accelerator with an Application for Graph Similarity Computation
While there have been many studies on hardware acceleration for deep learning on images, there has been a rather limited focus on accelerating deep learning applications involving graphs. The unique characteristics of graphs, such as the irregular memory access and dynamic parallelism, impose several challenges when the algorithm is mapped to a CPU or GPU. To address these challenges while exploiting all the available sparsity, we propose a flexible architecture called SPA-GCN for accelerating Graph Convolutional Networks (GCN), the core computation unit in deep learning algorithms on graphs. The architecture is specialized for dealing with many small graphs since the graph size has a significant impact on design considerations. In this context, we use SimGNN, a neural-network-based graph matching algorithm, as a case study to demonstrate the effectiveness of our architecture. The experimental results demonstrate that SPA-GCN can deliver a high speedup compared to a multi-core CPU implementation and a GPU implementation, showing the efficiency of our design.
Code (0)
등록된 구현이 없습니다.
Tasks
CPUDeep LearningGPUGraph MatchingGraph SimilaritySingle Particle AnalysisSimilar Papers 제목 키워드 기반
Lupulus: A Flexible Hardware Accelerator for Neural Networks
Neural networks have become indispensable for a wide range of applications, but they suffer from high computational- and memory-requirements, requiring optimizations from the algorithmic description of the network to the…
SchedulingNEURAghe: Exploiting CPU-FPGA Synergies for Efficient and Flexible CNN Inference Acceleration on Zynq SoCs
Deep convolutional neural networks (CNNs) obtain outstanding results in tasks that require human-level understanding of data, like image or speech recognition. However, their computational load is significant, motivating…
CPUspeech-recognitionSpeech RecognitionUser-friendly Comparison of Similarity Algorithms on Wikidata
While the similarity between two concept words has been evaluated and studied for decades, much less attention has been devoted to algorithms that can compute the similarity of nodes in very large knowledge graphs, like …
Entity LinkingKnowledge GraphsA Survey of FPGA-Based Robotic Computing
Recent researches on robotics have shown significant improvement, spanning from algorithms, mechanics to hardware architectures. Robotics, including manipulators, legged robots, drones, and autonomous vehicles, are now w…
Autonomous VehiclesCPUGPUSurveyLUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator
The emergence of neural network capabilities invariably leads to a significant surge in computational demands due to expanding model sizes and increased computational complexity. To reduce model size and lower inference …
Quantization