Online Task Scheduling Algorithm with Complex Dependencies in Edge Computing
Lei Shi, MA Zhaoxing, Yuqi Fan, Yi Shi, Xu Ding, Zhehao Li · Procedia Computer Science · 2022
In the edge computing network environment, our applications can be deployed on edge servers. The request to execute the application can be produced on the edge device and transmitted to the edge server for calculation. A complex request may be divided into multiple computing tasks and transmitted to different servers and then parallel calculated before obtaining the final result. How to schedule computing tasks in multiple requests so that all requests can be completed faster is a difficult problem, especially in the edge computing environment where we should consider the communicating work and the calculating work simultaneously. In this paper, we first build a task dependency model of the computing tasks included in the request based on the idea of dividing the method components of the application. The dependencies include sequence, selection and parallel. Then we propose an online scheduling algorithm MCOS based on optimizing the task with the maximum amount of calculation to solve the problem of the minimum sum of the completion time of all requests. In simulations, we show the algorithm MCOS has a better completion time.