PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing
Summary
This paper proposes PPO-STGNN, a reinforcement learning algorithm that combines proximal policy optimization with spatio-temporal graph neural networks to optimize DAG task scheduling in heterogeneous cloud-edge-end environments, improving load balancing and reducing completion time.
View Cached Full Text
Cached at: 09/04/26, 06:06 AM
# PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing Source: [https://arxiv.org/abs/2609.03503](https://arxiv.org/abs/2609.03503) [View PDF](https://arxiv.org/pdf/2609.03503) > Abstract: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\. ## Submission history From: Zihan Shen \[[view email](https://arxiv.org/show-email/cedd2db6/2609.03503)\] **\[v1\]**Thu, 3 Sep 2026 08:04:30 UTC \(678 KB\)
Similar Articles
PGPO: Potential-Guided Policy Optimization for Multi-Turn Agentic Tasks
PGPO proposes potential-guided policy optimization for multi-turn agentic tasks, enabling finer-grained credit assignment in LLM post-training and showing strong results on ALFWorld and WebShop benchmarks.
GraphPO: Graph-based Policy Optimization for Reasoning Models
GraphPO is a novel graph-based reinforcement learning framework that represents rollouts as a directed acyclic graph, merging semantically equivalent reasoning paths to reduce redundant exploration and improve credit assignment for large reasoning models.
StepPO: Step-Aligned Policy Optimization for Agentic Reinforcement Learning
StepPO introduces a step-centric paradigm for agentic reinforcement learning that aligns policy optimization with agent decision granularity, outperforming token-centric methods in multi-turn interaction tasks.
GAGPO: Generalized Advantage Grouped Policy Optimization
GAGPO proposes a critic-free RL method that uses a non-parametric grouped value proxy for step-level credit assignment in multi-turn agentic tasks, outperforming strong baselines on ALFWorld and WebShop.
Proximal Policy Optimization
OpenAI introduces Proximal Policy Optimization (PPO), a reinforcement learning algorithm that matches or outperforms state-of-the-art methods while being simpler to implement and tune. PPO uses a novel clipped objective function to constrain policy updates and has since become OpenAI's default RL algorithm.