Performance Evaluation of Hybrid Meta-Heuristics-Based Task Scheduling Algorithm for Energy Efficiency in Fog Computing

Performance Evaluation of Hybrid Meta-Heuristics-Based Task Scheduling Algorithm for Energy Efficiency in Fog Computing

Ali Garba Jakwa, Abdulsalam Yau Gital, Souley Boukari, Fatima Umar Zambuk
Copyright: © 2023 |Pages: 16
DOI: 10.4018/IJCAC.324758
Article PDF Download
Open access articles are freely available for download

Abstract

Task scheduling in fog computing is one of the areas where researchers are having challenges as the demand grows for the use of internet of things (IoT) to access cloud computing resources. Many resource scheduling and optimization algorithms were used by many researchers in fog computing; some used single techniques while others used combined schemes to achieve dynamic scheduling in fog computing, many optimization techniques were assessed based on deterministic and meta-heuristic to find out solution to task scheduling problem in fog computing but could not achieve excellent results as required. This article proposes hybrid meta-heuristic optimization algorithm (HMOA) for energy efficient task scheduling in fog computing, the study combined modified particle swarm optimization (MPSO) meta-heuristic and deterministic spanning tree (SPT) to achieve task scheduling with the intention of eliminating the drawbacks of the two algorithms when used separately, the MPSO was used to schedule user task requests among fog devices, while hybrid MPSO-SPT was used to perform resource allocation and resource management in the fog computing environment. The study implemented the proposed algorithm using iFogSim; the performance of the algorithm was evaluated, assessed, and compared with other state-of-the-art task scheduling and resource management algorithms, the proposed method performs better in terms of energy consumption, resource utilization and response time, and the study proposed future research on evaluating the execution time using the hybrid algorithm.
Article Preview
Top

Introduction

Fog computing (FC) is a cloud computing layer which extends cloud services to the edge layer or to the end user computing with the intension of optimal service provisioning and faster processing capabilities among the end users, it is not the intention of FC to replace cloud computing capability, but is to provide faster accessibility of the cloud services which includes; storage, processing and computation to the end users (Pradeep & Sharma, 2019).

With the increase in demand of cloud resources, task scheduling is one of the greatest challenge and area of interest among researchers in the field of cloud computing, it is generally known that the main function of cloud computing is resources provisioning, therefore many strategies of resource scheduling and optimization methods were used by many researchers in the area (Aliyu, Murali, Gital, & Boukari, 2020).

According to Aliyu, et al., (2021) Task scheduling can be classified and categorised based on real time, cloud services, workflow, or can be static or dynamic scheduling. Many dynamic scheduling techniques have been envesaged based on metaheuristics and deterministic to resolve scheduling prolems. Related research can be observed in (Li, Liu, Wu, & Li, 2019; Matrouk & Alatoun, 2021) and etc. Relavant cited works Verma, Bhardwaj, & Yadav, (2016) discused task allocation and scheduling techniques in Fog computing.

Amancio da Silva, Asamooning, Orrillo, Sofia, & Mendes, (2020) presented data placement algorithms in fog environment which further stated virtual machine selection and virtual machine allocation can be combined to optimise task scheduling that will be assigned to Cloud, therby efficient allocation of resource modules in the fog networks. Deteministic method is a technique of problem solving which follows a trigent sequence of defined procedure in solving a solution to a task which sometime are categorised as inconclusive/inaccurate, as a result of traping in to the local minium (Aliyu, Murali, Gital, & Boukari, 2020).

The concept of Meta-heuristics algorithms are set of problem solving method in which are desinged to find, select, or generate a heuristic that can produce a significantly better result to an optimization problem with few iterations. This algorithm provide better result through exploration and exploitation specifically with very limited computational effort or non complete information which is applicable to wide number of problems for task scheduling in fog computing. The following are examples of meta-heuristics algorithms; Particle Swarm Optimization (PSO), Cuckoo Search (CS), Cat Swarm Optimization (CSO), genetic algorithm (GA) and so on. These algorithms have been used and reasonably performed better in optimizing task scheduling and cloud service providers throughput in the area of minimizing makespan, balancing load and scalability by providing shortest optimal results within shortest period (Aliyu, et al., 2021).

The main purpose of this study is to propose a framework for an energy efficient task scheduling algorithm based on hybrid meta-heuristics optimization in fog computing environment with the intention of reducing energy consumption, improving response time and resource utilization in fog computing environment.

The paper is organized based on the following sections; section I presented the introduction of the paper which includes general terms and background about fog computing, section II presented the layers of fog computing which includes the general architecture of fog computing, section III presented the literatures that are related to fog computing with regards to task scheduling, section IV presented the methodology of the proposed system design which include the system architecture and the various parameters required for the development of the proposed system and finally section V presented the conclusion and future directions of the research.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing