{"title":"数据中心DAG任务调度的一种带注意机制的深度强化学习方法","authors":"Jun Cai, Li-juan Lu","doi":"10.1002/cpe.70279","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Task scheduling algorithms for data centers must be capable of making instantaneous decisions based on the current state of the system. However, due to information limitations, these scheduling algorithms often fail to achieve optimal scheduling plans. To address the information bottleneck faced in DAG (Directed Acyclic Graph) task scheduling within data centers, this paper proposes a deep reinforcement learning scheduling model based on a DAG attention mechanism. This model utilizes the attention mechanism to capture the potential relationships between dependent tasks, thereby improving scheduling efficiency and system performance under limited information conditions. The experimental results indicate that our DAG attention mechanism can significantly reduce makespan.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 25-26","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Deep Reinforcement Learning Approach With Attention Mechanism for DAG Task Scheduling in Data Centers\",\"authors\":\"Jun Cai, Li-juan Lu\",\"doi\":\"10.1002/cpe.70279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Task scheduling algorithms for data centers must be capable of making instantaneous decisions based on the current state of the system. However, due to information limitations, these scheduling algorithms often fail to achieve optimal scheduling plans. To address the information bottleneck faced in DAG (Directed Acyclic Graph) task scheduling within data centers, this paper proposes a deep reinforcement learning scheduling model based on a DAG attention mechanism. This model utilizes the attention mechanism to capture the potential relationships between dependent tasks, thereby improving scheduling efficiency and system performance under limited information conditions. The experimental results indicate that our DAG attention mechanism can significantly reduce makespan.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 25-26\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70279\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70279","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
A Deep Reinforcement Learning Approach With Attention Mechanism for DAG Task Scheduling in Data Centers
Task scheduling algorithms for data centers must be capable of making instantaneous decisions based on the current state of the system. However, due to information limitations, these scheduling algorithms often fail to achieve optimal scheduling plans. To address the information bottleneck faced in DAG (Directed Acyclic Graph) task scheduling within data centers, this paper proposes a deep reinforcement learning scheduling model based on a DAG attention mechanism. This model utilizes the attention mechanism to capture the potential relationships between dependent tasks, thereby improving scheduling efficiency and system performance under limited information conditions. The experimental results indicate that our DAG attention mechanism can significantly reduce makespan.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.