RGMSC: Relational Graph Attention Assisted Multi-Agent Soft Actor-Critic for Task Allocation in Heterogeneous Computing Power Networks

As computing power networks evolve towards widearea heterogeneous architectures, and the dependency relationships of massive tasks become complex, on-demand and realtime access to ubiquitous distributed computing power resources is required. However, the distribution of heterogeneous node resources is uneven, and existing centralized allocation methods are difficult to meet the real-time requirements of wide area heterogeneous computing power networks, while existing distributed methods are difficult to effectively integrate dispersed local information to support global collaboration. In order to improve the collaboration and efficiency of task allocation in wide area heterogeneous computing networks, this paper proposes a multi-agent reinforcement learning algorithm RGMSC based on relational graph attention network (RGAT). Firstly, the task scheduling is modeled as a joint optimization problem, and a decentralized partially observable Markov decision process (DecPOMDP) model is constructed to coordinate multidimensional resources such as computing, memory, and storage. Secondly, a collaborative learning framework combining the RGAT and multi-agent soft actor critic (MASAC) is innovatively designed, which dynamically captures resource associations and topological features between agents through RGAT, enhances strategy exploration ability through maximum entropy reinforcement learning, and achieves efficient collaborative decision-making under local observation. The offline training, online distributed inference mode is adopted to solve the high latency of traditional centralized scheduling with the global information loss of distributed scheduling. Experiments have shown that compared to MASAC, deep deterministic policy gradient (DDPG), and multi-agent deep deterministic policy gradient (MADDPG), RGMSC reduces task completion time by $28.6 \%$, energy consumption by $24.7 \%$, and enhances energy efficiency by $32.5 \%$ in different scenarios.

Authors

Institutions

Publication Details

Published
2025-09-22
DOI
https://doi.org/10.23919/apnoms67058.2025.11181359
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RGMSC: Relational Graph Attention Assisted Multi-Agent Soft Actor-Critic for Task Allocation in Heterogeneous Computing Power Networks

Manjun Zhang, Xuesong Qiu, Shaoyong Guo, Ying Wang et al.
Cloud Computing and Resource Management
article

RGMSC: Relational Graph Attention Assisted Multi-Agent Soft Actor-Critic for Task Allocation in Heterogeneous Computing Power Networks

Manjun Zhang, Xuesong Qiu, Shaoyong Guo, Ying Wang, Peng Yu, Jie Meng
article en

Abstract

As computing power networks evolve towards widearea heterogeneous architectures, and the dependency relationships of massive tasks become complex, on-demand and realtime access to ubiquitous distributed computing power resources is required. However, the distribution of heterogeneous node resources is uneven, and existing centralized allocation methods are difficult to meet the real-time requirements of wide area heterogeneous computing power networks, while existing distributed methods are difficult to effectively integrate dispersed local information to support global collaboration. In order to improve the collaboration and efficiency of task allocation in wide area heterogeneous computing networks, this paper proposes a multi-agent reinforcement learning algorithm RGMSC based on relational graph attention network (RGAT). Firstly, the task scheduling is modeled as a joint optimization problem, and a decentralized partially observable Markov decision process (DecPOMDP) model is constructed to coordinate multidimensional resources such as computing, memory, and storage. Secondly, a collaborative learning framework combining the RGAT and multi-agent soft actor critic (MASAC) is innovatively designed, which dynamically captures resource associations and topological features between agents through RGAT, enhances strategy exploration ability through maximum entropy reinforcement learning, and achieves efficient collaborative decision-making under local observation. The offline training, online distributed inference mode is adopted to solve the high latency of traditional centralized scheduling with the global information loss of distributed scheduling. Experiments have shown that compared to MASAC, deep deterministic policy gradient (DDPG), and multi-agent deep deterministic policy gradient (MADDPG), RGMSC reduces task completion time by $28.6 \%$, energy consumption by $24.7 \%$, and enhances energy efficiency by $32.5 \%$ in different scenarios.

Beijing University of Posts and Telecommunications (CN), State Key Laboratory of Networking and Switching Technology
Openalex Percentile: Top 59%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.