Metraipolis › archive › dc_723eb9fa859a

PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing — arXiv:2609.03503

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03503
License (as archived)
CC0-1.0
Archived
2026-10-17T01:10:49.505Z
SHA-256 of the archived text
8cc7ff020e8953857dcee5a208eb560cdcb79dff6b163ba7f5a5d00dfa703fd4
Stable URL of this page
https://metraipolis.com/documento/dc_723eb9fa859a

How to cite

PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing — arXiv:2609.03503 — arXiv (en), https://arxiv.org/abs/2609.03503 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_723eb9fa859a (Metraipolis archive dc_723eb9fa859a, sha256 8cc7ff020e8953857dcee5a208eb560cdcb79dff6b163ba7f5a5d00dfa703fd4)
BibTeX
@misc{dc723eb9fa859a,
  title = {PPO-STGNN: A Proximal Policy Optimization Approach with Spatio-Temporal Graph Neural Networks for DAG Task Scheduling in Cloud-Edge-End Computing — arXiv:2609.03503},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03503},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_723eb9fa859a; sha256 8cc7ff020e8953857dcee5a208eb560cdcb79dff6b163ba7f5a5d00dfa703fd4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03503. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.03503 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T00:28:02.854Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).