Vol.71, No.1, 2022, pp.843-854, doi:10.32604/cmc.2022.017504
A New Task Scheduling Scheme Based on Genetic Algorithm for Edge Computing
  • Zhang Nan1, Li Wenjing1,*, Liu Zhu1, Li Zhi1, Liu Yumin1, Nurun Nahar2
1 State Grid Information & Telecommunication Group Co., Ltd, Beijing, 102200, China
2 University of Chittagong (CU), Chittagong, Bangladesh
* Corresponding Author: Li Wenjing. Email:
Received 01 February 2021; Accepted 13 July 2021; Issue published 03 November 2021
With the continuous evolution of smart grid and global energy interconnection technology, amount of intelligent terminals have been connected to power grid, which can be used for providing resource services as edge nodes. Traditional cloud computing can be used to provide storage services and task computing services in the power grid, but it faces challenges such as resource bottlenecks, time delays, and limited network bandwidth resources. Edge computing is an effective supplement for cloud computing, because it can provide users with local computing services with lower latency. However, because the resources in a single edge node are limited, resource-intensive tasks need to be divided into many subtasks and then assigned to different edge nodes by resource cooperation. Making task scheduling more efficient is an important issue. In this paper, a two-layer resource management scheme is proposed based on the concept of edge computing. In addition, a new task scheduling algorithm named GA-EC(Genetic Algorithm for Edge Computing) is put forth, based on a genetic algorithm, that can dynamically schedule tasks according to different scheduling goals. The simulation shows that the proposed algorithm has a beneficial effect on energy consumption and load balancing, and reduces time delay.
Smart grid; energy consumption; task scheduling; resource management
Cite This Article
Nan, Z., Wenjing, L., Zhu, L., Zhi, L., Yumin, L. et al. (2022). A New Task Scheduling Scheme Based on Genetic Algorithm for Edge Computing. CMC-Computers, Materials & Continua, 71(1), 843–854.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.