An Effective analysis on various task scheduling algorithms in Fog computing

Abstract

Fog computing involved as an extension of cloud and distributed systems fog nodes allowing data to be processed closer to the edge device and reduces the latency and bandwidth, storage capacity of IoT tasks. Task scheduling in fog computing involves allocating the tasks in fog nodes based on factors such as node availability, processing power, memory, and network connectivity. In task scheduling we have various scheduling algorithms that are nature inspired and bio-inspired algorithms but still we have latency issues because it is an NP-hard problem. This paper reviews the existing task scheduling algorithms modeled by metaheuristic, nature inspired and machine learning which address the various scheduling parameters like cost, response time, energy consumption, quality of services, execution time, resource utilization, makespan, throughput but still parameters like trust, fault tolerance not addressed by many of the existing authors. Trust and fault tolerance gives an impact and task scheduling trust is necessary to tasks and assign responsibility to systems, while fault tolerance ensures that the system can continue to operate even when failures occur. A balance of trust and fault tolerance gives a quality of service and efficient task scheduling therefore this paper done analysis on parameters like trust, fault tolerance and given research directions.