Abstract
With the development of edge computing, a large number of tasks can be offloaded to the edge server for computing, among which the dispatching and scheduling of dependent tasks has attracted extensive attention. The offloading of dependent tasks mainly has the following problems: how to select an appropriate edge server for dispatching, how to arrange the scheduling order of edge servers to better schedule tasks, and how to solve the task dependency problem. In this paper, we proposal a dispatching and scheduling method DAMD, based on reinforcement learning and multi-agent reinforcement learning, to solve the above three problems. Specifically, as the first step of DAMD, a reinforcement learning approach is designed to estimate the network load and dynamically dispatch tasks to the appropriate edge servers. Each edge server is regarded as an agent by a multi-agent reinforcement learning method, the second step of DAMD, which comprehensively considers the dependency relationship between tasks and the scheduling relationship between servers to achieve the efficiency and fairness of task scheduling. Finally, the results show that our method can better complete the task within the deadline and greatly reduce the average response time according to the time sensitivity requirement.
| Original language | English |
|---|---|
| Pages (from-to) | 280-285 |
| Number of pages | 6 |
| Journal | Proceedings of the International Conference on Software Engineering and Knowledge Engineering, SEKE |
| Volume | 2023-July |
| DOIs | |
| State | Published - 2023 |
| Event | 35th International Conference on Software Engineering and Knowledge Engineering, SEKE 2023 - Hybrid, San Francisco, United States Duration: 1 Jul 2023 → 10 Jul 2023 |
Keywords
- deep reinforcement learning
- dependent task
- edge computing
- multi-agent deep reinforcement learning