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.
By Yangshuo Qi, Chenwei Wang, Zihan Shen, Songlin Sun
arXiv:2609.14968v1 Announce Type: new
Abstract: Online scheduling of dependency-aware tasks in heterogeneous cloud clusters is a fundamental yet challenging problem due to the complex interplay betwe...
By Tiangang Li, Shi Ying, Xiangbo Tian
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:2609.14952v1 Announce Type: new
Abstract: Dynamic cloud workflow scheduling must balance deadline satisfaction, container utilization, and energy consumption while dealing with stochastic task-...
By Zongjin Li, Shaohan Feng, Chunxi Yang, Wenbo Wang
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
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