Open AccessMulti-node Task Scheduling Algorithm for Edge Computing Based on Multi-Objective Optimization
Author(s) -
Zheng Shi,
Zhiguo Shi
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1607/1/012017
Subject(s) - computer science , scheduling (production processes) , fixed priority pre emptive scheduling , dynamic priority scheduling , distributed computing , fair share scheduling , two level scheduling , rate monotonic scheduling , round robin scheduling , bidding , computer network , mathematical optimization , quality of service , marketing , business , mathematics
In edge computing, nodes are highly dynamic and resources are unbalanced. Due to the need to ensure near real-time response of tasks, when task scheduling is required, the resource availability of the target node needs to be estimated. It prevents the node’s computing resources from being exhausted or the node from failing or going offline, when the task is pushed to the target node. In this paper, by studying multi-node task scheduling technology, a multi-objective optimization model is established, while considering the impact of completion time, energy consumption and load balancing on task scheduling. The task scheduling problem is transformed into a bidding model, and the offloading location of subtasks is determined in real time to meet the requirements of delay-sensitive tasks. Finally, simulation experiments are used to obtain the availability of the technology for multi-node task scheduling, which provides new ideas for task scheduling in edge computing.