计算机科学
有向无环图
分布式计算
调度(生产过程)
作业车间调度
动态优先级调度
地铁列车时刻表
固定优先级先发制人调度
有向图
负载平衡(电力)
公平份额计划
两级调度
人工神经网络
单调速率调度
计算
循环调度
图形
拓扑排序
最优化问题
网络拓扑
启发式
处理器调度
并行计算
任务分析
计算复杂性理论
功率图分析
缩小
作者
Yangshuo Qi,Chenwei Wang,Zihan Shen,Songlin Sun
标识
DOI:10.48550/arxiv.2609.03503
摘要
With the rapid development of the Internet of Things, computation intensive directed acyclic graph (DAG) tasks have become increasingly common in cloud-edge-end collaborative environments. However, cloud, edge, and end nodes are highly heterogeneous in computing capacity, network bandwidth, and energy consumption, which makes the efficient scheduling of tasks with complex dependencies an NP-hard problem. Traditional heuristic algorithms and conventional reinforcement-learning methods often fail to capture the spatio-temporal dynamics of system resources. This paper proposes PPO-STGNN, a DAG task-scheduling algorithm that integrates proximal policy optimization (PPO) with spatio-temporal graph neural networks (STGNNs). The method uses an STGNN to extract features from both the DAG task topology and the physical cloud-edge-end resource graph, and then optimizes the scheduling policy through PPO to minimize makespan and schedule length ratio (SLR) while improving CPU and memory load balancing. To accelerate convergence, a multi-teacher behavior-cloning mechanism is introduced for pretraining. Experimental results show that PPO-STGNN significantly improves load balancing while maintaining a low completion time, making it suitable for dynamic and heterogeneous cloud-edge- end DAG scheduling scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI