DBO-DDQN: a cloud-edge collaborative task scheduling strategy integrating dung beetle optimization and temporal difference learning
Yufei Wang et al.
What the paper says
To tackle the challenges of scheduling computationally intensive tasks in edge computing environments, this paper proposes a novel hybrid scheduling method called “Dual-Stage Dung Beetle Optimization and Value Approximation Learning Guided by Clustering” (DBO-DDQN). First, a lightweight task clustering method is designed based on task size and time urgency to reduce the computational complexity of task scheduling. Then, the foraging behavior of a dung beetle population is simulated and the foraging process is improved to optimize the matching between task clusters and computing nodes. Finally, a novel temporal difference learning method is proposed to further optimize the matching strategy between tasks within clusters and computing nodes. Experimental results show that, compared to cat swarm optimization (CSO), red-tailed hawk algorithm (RTH), deep Q networks (DQN), DDQN, and Dueling DQN, the proposed algorithm improves task success rates by 15%, 13%, 23%, 19%, and 22%, and enhances weighted multi-objective scheduling performance by 49%, 67%, 33%, 26%, and 22%, respectively, while maintaining low latency and energy consumption. These results highlight the algorithm’s effectiveness and superiority in managing large-scale, computation intensive task scheduling within edge computing environments.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.