arXiv AI By Yangshuo Qi, Chenwei Wang, Zihan Shen, Songlin Sun

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

Read the original on arXiv AI →

PPO-STGNN is a DAG task‑scheduling algorithm that combines proximal policy optimization with spatio‑temporal graph neural networks. It extracts features from both the task topology and the heterogeneous cloud‑edge‑end resource graph, then optimizes scheduling to reduce makespan and schedule length ratio while balancing CPU and memory loads. A multi‑teacher behavior‑cloning pretraining step accelerates convergence, and experiments show significant load‑balancing improvements with low completion times in dynamic, heterogeneous environments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
Sep 3

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

PPO-STGNN is a DAG task‑scheduling algorithm that combines proximal policy optimization with spatio‑temporal graph neural networks to address the NP‑hard scheduling problem in heterogeneous cloud‑edge‑end environments. It extracts features from both the DAG task topology and the physical resource graph, then optimizes the scheduling policy to minimize makespan and schedule length ratio while improving CPU and memory load balancing. A multi‑teacher behavior‑cloning pretraining step accelerates convergence, and experiments demonstrate significant load‑balancing gains with low completion times in dynamic, heterogeneous settings.

arXiv Machine Learning
Jul 22

Multi-Timescale Latent-Action DRL for Joint Optimization in Edge-Cloud Networks

arXiv:2607. 18288v1 Announce Type: new Abstract: Load imbalance across edge and cloud layers degrades latency performance in hierarchical edge-cloud computing (HECC) systems under dynamic task arrivals and heterogeneous resources, leading to severe queuing delays and inefficient resource utilization.

By Vo Phi Son, Van-Dinh Nguyen, Ngoc Hung Nguyen, Trinh Van Chien, Symeon Chatzinotas
arXiv AI
Jun 16

A Learning Method with Gap-Aware Generation for Heterogeneous DAG Scheduling

arXiv:2603. 23249v2 Announce Type: replace-cross Abstract: Efficient scheduling of directed acyclic graphs (DAGs) is a core problem in large-scale data-intensive computing systems, where query plans, data-processing workloads, and computation graphs consist of dependent tasks competing for limited heterogeneous resource pools.

By Ruisong Zhou, Haijun Zou, Li Zhou, Chumin Sun, Zaiwen Wen
arXiv Machine Learning
Jul 8

Joint Energy Management and Coordinated AIGC Workload Scheduling for Distributed Data Centers: A Diffusion-Aided Reward Shaping Approach

arXiv:2605. 02965v2 Announce Type: replace Abstract: Artificial intelligence-generated content (AIGC) has emerged as a transformative paradigm for automating the creation of diverse and customized content, giving rise to rapidly growing computational workloads in cloud data centers.

By Yang Fu, Peng Qin, Liming Chen, Zihao Zhang, Hao Yu, Yifei Wang