GCoDE: Efficient Device-Edge Co-Inference for GNNs via Architecture-Mapping Co-Search
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have emerged as the state-of-the-art graph learning method. However, achieving efficient GNN inference on edge devices poses significant challenges, limiting their application in real-world edge scenarios. This is due to the high computational cost of GNNs and limited hardware resources on edge devices, which prevent GNN inference from meeting real-time and energy requirements. As an emerging paradigm, device-edge co-inference shows potential for improving inference efficiency and reducing energy consumption on edge devices. Despite its potential, research on GNN device-edge co-inference remains scarce, and our findings show that traditional model partitioning methods are ineffective for GNNs. To address this, we propose GCoDE, the first automatic framework for GNN architecture-mapping Co-design and deployment on Device-Edge hierarchies. By abstracting the device communication process into an explicit operation, GCoDE fuses the architecture and mapping scheme in a unified design space for joint optimization. Additionally, GCoDE's system performance awareness enables effective evaluation of architecture efficiency across diverse heterogeneous systems. By analyzing the energy consumption of various GNN operations, GCoDE introduces an energy prediction method that improves energy assessment accuracy and identifies energy-efficient solutions. Using a constraint-based random search strategy, GCoDE identifies the optimal solution in 1.5 hours, balancing accuracy and efficiency. Moreover, the integrated co-inference engine in GCoDE enables efficient deployment and execution of GNN co-inference. Experimental results show that GCoDE can achieve up to 44.9x speedup and 98.2% energy reduction compared to existing approaches across diverse applications and system configurations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
20 of 39 references.
References · 20
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
- 2020Point-GNN: Graph Neural Network for 3D Object Detection in a Point Cloudcited by 335
- 2019Evaluating the Search Phase of Neural Architecture Searchcited by 120
- 2019Machine Learning at the Network Edge: A Surveycited by 84
- 2020Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networkscited by 77
- 2021Rethinking Graph Neural Architecture Search from Message-passingcited by 26
- 2022A Survey on Collaborative DNN Inference for Edge Intelligencecited by 24
- 2020Characterizing and Understanding GCNs on GPUcited by 22
- 2020Branchy-GNN: a Device-Edge Co-Inference Framework for Efficient Point Cloud Processingcited by 21
- 2022The Larger The Fairer? Small Neural Networks Can Achieve Fairness for Edge Devicescited by 21
- 2021Towards Efficient Graph Convolutional Networks for Point Cloud Handlingcited by 18
8 more
- 2023Hardware-Aware Graph Neural Network Automated Design for Edge Computing Platformscited by 12
- 2021Towards Efficient Point Cloud Graph Neural Networks Through Architectural Simplificationcited by 9
- 2023MaGNAS: A Mapping-Aware Graph Neural Architecture Search Framework for Heterogeneous MPSoC Deploymentcited by 9
- 2020Lattice-based Improvements for Voice Triggering Using Graph Neural Networkscited by 7
- 2022SUGAR: Efficient Subgraph-level Training via Resource-aware Graph Partitioningcited by 6
- 2021LENS: Layer Distribution Enabled Neural Architecture Search in Edge-Cloud Hierarchiescited by 5
- 2023Roulette: A Semantic Privacy-Preserving Device-Edge Collaborative Inference Framework for Deep Learning Classification Taskscited by 2
- 2025GraNNite: Enabling High-Performance Execution of Graph Neural Networks on Resource-Constrained Neural Processing Unitscited by 2
Built on by
Not cited yet.