arXiv:2504.15905cs.LGcs.AI2025-04被引 13

针对边缘计算中图神经网络通信开销大的问题,提出动态图划分与任务调度方案。

GraphEdge: Dynamic Graph Partition and Task Scheduling for GNNs Computing in Edge Network

  • 基于图结构动态划分用户关联数据,减少跨边通信
  • 通过强化学习优化任务调度,降低处理延迟与能耗
  • 适用于动态物联网场景,适合边缘智能系统研发者

随着物联网设备的指数级增长,边缘计算(EC)正逐渐在提供低成本服务中发挥关键作用。然而,现有方法在用户数据具有关联性的图结构场景(如交通流量预测、社交推荐系统)中表现不佳,尤其基于图神经网络(GNN)的方法导致服务器间通信开销过高。为此,我们提出GraphEdge,一种高效的基于GNN的边缘计算架构。该架构考虑用户间存在关联,处理某一用户任务时需依赖其邻居的数据。首先,系统在每个时间步感知用户拓扑,并将数据关联表示为图布局;随后,采用所提出的分层遍历图割算法(HiCut),根据GNN聚合特性将图划分为多个弱关联子图,从而最小化不同子图间的通信开销;最后,基于优化后的图布局,执行基于深度强化学习的图卸载算法(DRLGO),以子图为单位制定卸载策略,尽可能将同一子图内的用户任务分配至同一边缘服务器,同时最小化任务处理时间和系统能耗。实验表明,该架构具备良好的有效性与动态适应能力,即使在动态场景下仍表现优异。

原文摘要 · Abstract (English)

With the exponential growth of Internet of Things (IoT) devices, edge computing (EC) is gradually playing an important role in providing cost-effective services. However, existing approaches struggle to perform well in graph-structured scenarios where user data is correlated, such as traffic flow prediction and social relationship recommender systems. In particular, graph neural network (GNN)-based approaches lead to expensive server communication cost. To address this problem, we propose GraphEdge, an efficient GNN-based EC architecture. It considers the EC system of GNN tasks, where there are associations between users and it needs to take into account the task data of its neighbors when processing the tasks of a user. Specifically, the architecture first perceives the user topology and represents their data associations as a graph layout at each time step. Then the graph layout is optimized by calling our proposed hierarchical traversal graph cut algorithm (HiCut), which cuts the graph layout into multiple weakly associated subgraphs based on the aggregation characteristics of GNN, and the communication cost between different subgraphs during GNN inference is minimized. Finally, based on the optimized graph layout, our proposed deep reinforcement learning (DRL) based graph offloading algorithm (DRLGO) is executed to obtain the optimal offloading strategy for the tasks of users, the offloading strategy is subgraph-based, it tries to offload user tasks in a subgraph to the same edge server as possible while minimizing the task processing time and energy consumption of the EC system. Experimental results show the good effectiveness and dynamic adaptation of our proposed architecture and it also performs well even in dynamic scenarios.

图神经网络边缘计算任务调度强化学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。