Lei Zeng
Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge Computing for Makespan Optimization
Zeng, Lei; Liu, Qi; Shen, Shigen; Liu, Xiaodong
Abstract
Edge computing nodes undertake more and more tasks as business density grows. How to efficiently allocate large-scale and dynamic workloads to edge computing resources has become a critical challenge. An edge task scheduling approach based on an improved Double Deep Q Network (Double DQN) is proposed in this paper. The Double DQN is adopted to separate the calculation of the target Q value and the selection of the action for the target Q value in two networks, and a new reward function is designed. Furthermore, a control unit is added to the experience replay unit of the agent. The management methods of experience data are modified to fully utilize the value of experience data and improve learning efficiency. Reinforcement learning agents usually learn from an ignorant state, which is inefficient. Therefore, a novel particle swarm optimization algorithm with an improved fitness function is proposed, which can generate optimal solutions for task scheduling. These optimized solutions are provided for the agent to pre-train network parameters, which allows the agent to get a better cognition level. The proposed algorithm is compared with the other six methods in simulation experiments. Results show that the proposed algorithm outperforms other benchmark methods regarding makespan.
Citation
Zeng, L., Liu, Q., Shen, S., & Liu, X. (2024). Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge Computing for Makespan Optimization. Tsinghua Science and Technology, 29(3), 806 - 817. https://doi.org/10.26599/TST.2023.9010058
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 27, 2023 |
Publication Date | 2024-06 |
Deposit Date | Aug 15, 2023 |
Publicly Available Date | Jan 11, 2024 |
Print ISSN | 1007-0214 |
Publisher | Institute of Electrical and Electronics Engineers |
Peer Reviewed | Peer Reviewed |
Volume | 29 |
Issue | 3 |
Pages | 806 - 817 |
DOI | https://doi.org/10.26599/TST.2023.9010058 |
Keywords | edge computing; task scheduling; reinforcement learning; makespan; Double Deep Q Network (DQN) |
Public URL | http://researchrepository.napier.ac.uk/Output/3169124 |
Publisher URL | https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?reload=true&punumber=5971803 |
Files
Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge Computing for Makespan Optimization
(1.3 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
CC BY 4.0
You might also like
Towards Building a Smart Water Management System (SWAMS) in Nigeria
(2024)
Presentation / Conference Contribution
Utilizing the Ensemble Learning and XAI for Performance Improvements in IoT Network Attack Detection
(2024)
Presentation / Conference Contribution
Emotion Recognition on Social Media Using Natural Language Processing (NLP) Techniques
(2023)
Presentation / Conference Contribution
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search