A DQN-based resource scheduling optimization algorithm for multi-computing nodes of large AI models
In the booming era of artificial intelligence, the demand for computing resources in AI large-model training is increasing exponentially. However, the traditional centralized computing resource management model fails to meet this growing demand. This paper focuses on the resource utilization issue of multiple computing center nodes and introduces the Deep Q-Network (DQN) algorithm to optimize the logic and strategy of computing task scheduling. A system model encompassing a specific state space, action space, and reward mechanism is established. A one-dimensional DNN network serves as the DQN training model, which is trained by means of the Mean Squared Error (MSE) loss function and the RMSProp optimizer. In the experiment, the DQN is compared with five traditional algorithm models. The results demonstrate that the DQN exhibits the smallest and most balanced fluctuations in resource utilization, boasting the best performance. Consequently, it offers an effective solution for computing resource management.
Authors
- Wenpeng Cui (ORCID: https://orcid.org/0000-0001-6637-7255)
- Yubin Gong (ORCID: https://orcid.org/0000-0003-3014-1309)
- Xu Huang (ORCID: https://orcid.org/0000-0003-2754-334X)
- Jingjing Liu (ORCID: https://orcid.org/0000-0002-5331-7015)
- X. J. Bi (ORCID: https://orcid.org/0000-0001-5413-7297)
Institutions
- China Mobile (China) (CN)
- Beijing Jiaotong University (CN)
Publication Details
- Published
- 2025-03-14
- DOI
- https://doi.org/10.1109/itoec63606.2025.10968894
- Primary Topic
- Cloud Computing and Resource Management
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Nature
- Fundamental Research Funds for the Central Universities