Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach

被引:101
作者
Azizi, Sadoon [1 ]
Shojafar, Mohammad [2 ]
Abawajy, Jemal [3 ]
Buyya, Rajkumar [4 ]
机构
[1] Univ Kurdistan, Dept Comp Engn & IT, Sanandaj, Iran
[2] Univ Surrey, Inst Commun Syst ICS, 5GIC & 6GIC, Guildford GU27XH, England
[3] Deakin Univ, Sch Informat Technol, Geelong, Vic 3220, Australia
[4] Univ Melbourne, Sch Comp & Informat Syst, CLOUDS Lab, Melbourne, Vic 3010, Australia
基金
欧盟地平线“2020”;
关键词
Internet of Things; Fog computing; Cloud computing; Task scheduling; Semi-greedy algorithm; Deadline-aware; Energy consumption; CLOUD; OPTIMIZATION; ALLOCATION;
D O I
10.1016/j.jnca.2022.103333
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid advancement of Internet of Things (IoT) devices, a variety of IoT applications that require a real-time response and low latency have emerged. Fog computing has become a viable platform for processing emerging IoT applications. However, fog computing devices tend to be highly distributed, dynamic, and resource-constrained, so deploying fog computing resources effectively for executing heterogeneous and delay-sensitive IoT tasks is a fundamental challenge. In this paper, we mathematically formulate the task scheduling problem to minimize the total energy consumption of fog nodes (FNs) while meeting the quality of service (QoS) requirements of IoT tasks. We also consider the minimization of the deadline violation time in our model. Next, we propose two semi-greedy based algorithms, namely priority-aware semi-greedy (PSG) and PSG with multistart procedure (PSG-M), to efficiently map IoT tasks to FNs. We evaluate the performance of the proposed task scheduling approaches with respect to the percentage of IoT tasks that meet their deadline requirement, total energy consumption, total deadline violation time, and the system's makespan. Compared with existing algorithms, the experiment results confirm that the proposed algorithms improve the percentage of tasks meeting their deadline requirement up to 1.35x and decrease the total deadline violation time up to 97.6% compared to the second-best results, respectively, while the energy consumption of fog resources and makespan of the system are optimized.
引用
收藏
页数:13
相关论文
共 64 条
[1]   Deploying Fog Computing in Industrial Internet of Things and Industry 4.0 [J].
Aazam, Mohammad ;
Zeadally, Sherali ;
Harras, Khaled A. .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2018, 14 (10) :4674-4682
[2]  
Abdel-Basset M., 2020, IEEE Trans. Ind. Inform.
[3]   Energy-Aware Metaheuristic Algorithm for Industrial-Internet-of-Things Task Scheduling Problems in Fog Computing Applications [J].
Abdel-Basset, Mohamed ;
El-Shahat, Doaa ;
Elhoseny, Mohamed ;
Song, Houbing .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (16) :12638-12649
[4]   Scheduling Internet of Things requests to minimize latency in hybrid Fog-Cloud computing [J].
Aburukba, Raafat O. ;
AliKarrar, Mazin ;
Landolsi, Taha ;
El-Fakih, Khaled .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 111 :539-551
[5]   DPTO: A Deadline and Priority-Aware Task Offloading in Fog Computing Framework Leveraging Multilevel Feedback Queueing [J].
Adhikari, Mainak ;
Mukherjee, Mithun ;
Srirama, Satish Narayana .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (07) :5773-5782
[6]  
Ale L., 2021, IEEE T COGN COMMUN
[7]   Task scheduling approaches in fog computing: A systematic review [J].
Alizadeh, Mohammad Reza ;
Khajehvand, Vahid ;
Rahmani, Amir Masoud ;
Akbari, Ebrahim .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2020, 33 (16)
[8]   A novel approach for IoT tasks offloading in edge-cloud environments [J].
Almutairi, Jaber ;
Aldossary, Mohammad .
JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS, 2021, 10 (01)
[9]  
[Anonymous], 2012, Deadline scheduling for real-time systems: EDF and related algorithms
[10]  
Azizi S., 2021, PSG PSG M SOURCE COD