A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline

15Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Wang, S., Li, Y., Pang, S., Lu, Q., Wang, S., & Zhao, J. (2020). A Task Scheduling Strategy in Edge-Cloud Collaborative Scenario Based on Deadline. Scientific Programming, 2020. https://doi.org/10.1155/2020/3967847

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free