计算机科学
强化学习
调度(生产过程)
分布式计算
马尔可夫决策过程
可观测性
作业车间调度
预订
动态优先级调度
网络拓扑
马尔可夫链
马尔可夫过程
部分可观测马尔可夫决策过程
动态规划
数学优化
异构网络
任务(项目管理)
公平份额计划
任务分析
理论(学习稳定性)
实时计算
两级调度
连续时间马尔可夫链
最优化问题
单调速率调度
负载平衡(电力)
作者
Xinyi Li,Chao Wang,Jiakai Liang,Keqiang Yue,Wenjun Li
摘要
ABSTRACT In edge–cloud collaborative computing, efficient scheduling of concurrent task chains is essential for reducing end‐to‐end latency. However, heterogeneous resources, dynamic link contention, and coupled routing‐computation decisions make it difficult to improve system efficiency while reducing communication conflicts. To address these challenges, we formulate concurrent heterogeneous task‐chain scheduling under partial observability as a multi‐agent partially observable Markov game and propose a MARL‐based scheduling method. Each task chain is represented by a mobile agent that makes routing, computation, data‐access, and waiting decisions based on local observations. Building upon a multi‐agent proximal policy optimization (MAPPO) architecture, we develop DC‐MAPPO, which introduces a Directional Clamp mechanism to improve policy update stability under high‐concurrency conditions. In addition, a dynamic action masking strategy is designed to ensure decision feasibility and reduce invalid exploration. Experimental results across multiple network topologies show that the proposed method outperforms the compared baselines in most tested settings. Under high‐load conditions, DC‐MAPPO reduces system makespan by 10.7%–17.1% and reduces the link reservation failure rate by 8.4–13.2 percentage points compared with MAPPO.
科研通智能强力驱动
Strongly Powered by AbleSci AI