A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline
Task scheduling plays a critical role in the performance of the edge-cloud collaborative. Whether the task is executed in the cloud and how it is scheduled in the cloud is an important issue. On the basis of satisfying the delay, this paper will schedule tasks on edge devices or cloud and present a...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Scientific Programming |
Online Access: | http://dx.doi.org/10.1155/2020/3967847 |
id |
doaj-6fa649c0954343a6a7ad54dc991e6298 |
---|---|
record_format |
Article |
spelling |
doaj-6fa649c0954343a6a7ad54dc991e62982021-07-02T11:54:58ZengHindawi LimitedScientific Programming1058-92441875-919X2020-01-01202010.1155/2020/39678473967847A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on DeadlineShudong Wang0Yanqing Li1Shanchen Pang2Qinghua Lu3Shuyu Wang4Jianli Zhao5College of Computer Science and Technology, China University of Petroleum, Qingdao 266000, ChinaCollege of Computer Science and Technology, China University of Petroleum, Qingdao 266000, ChinaCollege of Computer Science and Technology, China University of Petroleum, Qingdao 266000, ChinaData61, Eveleigh, NSW, AustraliaCollege of Computer Science and Technology, China University of Petroleum, Qingdao 266000, ChinaCollege of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266000, ChinaTask scheduling plays a critical role in the performance of the edge-cloud collaborative. Whether the task is executed in the cloud and how it is scheduled in the cloud is an important issue. On the basis of satisfying the delay, this paper will schedule tasks on edge devices or cloud and present a task scheduling algorithm for tasks that need to be transferred to the cloud based on the catastrophic genetic algorithm (CGA) to achieve global optimum. The algorithm quantifies the total task completion time and the penalty factor as a fitness function. By improving the roulette selection strategy, optimizing mutation and crossover operator, and introducing cataclysm strategy, the search scope is expanded. Furthermore, the premature problem of the evolutionary algorithm is effectively alleviated. The experimental results show that the algorithm can address the optimal local issue while significantly shortening the task completion time on the basis of satisfying tasks delays.http://dx.doi.org/10.1155/2020/3967847 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Shudong Wang Yanqing Li Shanchen Pang Qinghua Lu Shuyu Wang Jianli Zhao |
spellingShingle |
Shudong Wang Yanqing Li Shanchen Pang Qinghua Lu Shuyu Wang Jianli Zhao A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline Scientific Programming |
author_facet |
Shudong Wang Yanqing Li Shanchen Pang Qinghua Lu Shuyu Wang Jianli Zhao |
author_sort |
Shudong Wang |
title |
A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline |
title_short |
A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline |
title_full |
A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline |
title_fullStr |
A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline |
title_full_unstemmed |
A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline |
title_sort |
task scheduling strategy in edge-cloud collaborative scenario based on deadline |
publisher |
Hindawi Limited |
series |
Scientific Programming |
issn |
1058-9244 1875-919X |
publishDate |
2020-01-01 |
description |
Task scheduling plays a critical role in the performance of the edge-cloud collaborative. Whether the task is executed in the cloud and how it is scheduled in the cloud is an important issue. On the basis of satisfying the delay, this paper will schedule tasks on edge devices or cloud and present a task scheduling algorithm for tasks that need to be transferred to the cloud based on the catastrophic genetic algorithm (CGA) to achieve global optimum. The algorithm quantifies the total task completion time and the penalty factor as a fitness function. By improving the roulette selection strategy, optimizing mutation and crossover operator, and introducing cataclysm strategy, the search scope is expanded. Furthermore, the premature problem of the evolutionary algorithm is effectively alleviated. The experimental results show that the algorithm can address the optimal local issue while significantly shortening the task completion time on the basis of satisfying tasks delays. |
url |
http://dx.doi.org/10.1155/2020/3967847 |
work_keys_str_mv |
AT shudongwang ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT yanqingli ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT shanchenpang ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT qinghualu ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT shuyuwang ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT jianlizhao ataskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT shudongwang taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT yanqingli taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT shanchenpang taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT qinghualu taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT shuyuwang taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline AT jianlizhao taskschedulingstrategyinedgecloudcollaborativescenariobasedondeadline |
_version_ |
1721330651957821440 |