期刊
IEEE TRANSACTIONS ON CLOUD COMPUTING
卷 10, 期 4, 页码 2294-2308出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCC.2020.3032386
关键词
Genetic algorithm; NSGAII; task-scheduling; resource allocation; fog computing; cloud computing
类别
资金
- Capability Systems Centre, UNSW Canberra
- Australia Memorial spitfire Fellowship [PS39150]
- Cloud Technology Endowed Professorship
- NSF CREST Grant [HRD-1736209]
This article proposes a multi-objective task-scheduling optimization problem in a fog-cloud environment to minimize both makespans and total costs. An optimization model based on DNSGA-II is suggested to automatically allocate tasks to fog or cloud nodes, and discretize evolutionary operators for better task scheduling.
Processing data from Internet of Things (IoT) applications at the cloud centers has known limitations relating to latency, task scheduling, and load balancing. Hence, there have been a shift towards adopting fog computing as a complementary paradigm to cloud systems. In this article, we first propose a multi-objective task-scheduling optimization problem that minimizes both the makespans and total costs in a fog-cloud environment. Then, we suggest an optimization model based on a Discrete Non-dominated Sorting Genetic Algorithm II (DNSGA-II) to deal with the discrete multi-objective task-scheduling problem and to automatically allocate tasks that should be executed either on fog or cloud nodes. The NSGA-II algorithm is adapted to discretize crossover and mutation evolutionary operators, rather than using continuous operators that require high computational resources and not able to allocate proper computing nodes. In our model, the communications between the fog and cloud tiers are formulated as a multi-objective function to optimize the execution of tasks. The proposed model allocates computing resources that would effectively run on either the fog or cloud nodes. Moreover, it efficiently organizes the distribution of workloads through various computing resources at the fog. Several experiments are conducted to determine the performance of the proposed model compared with a continuous NSGA-II (CNSGA-II) algorithm and four peer mechanisms. The outcomes demonstrate that the model is capable of achieving dynamic task scheduling with minimizing the total execution times (i.e., makespans) and costs in fog-cloud environments.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据