Task scheduling approaches for fog computing

In recent years, the number of Internet of Things (IoT) devices/sensors has increased to a great extent. IoT is expected to connect billions of devices and humans in order to promote promising advantages. To support the computational demand of real time latency sensitive applications of largely geo-...

Full description

Saved in:
Bibliographic Details
Published in:Wireless and Optical Communication Conference pp. 38 - 42
Main Authors: Benchikh, Lina, Louail, Lemia
Format: Conference Proceeding
Language:English
Published: IEEE 07.10.2021
Subjects:
Cloud computing
Computational modeling
deadline
fog computing
Real-time systems
rejected tasks
Scheduling
Scheduling algorithms
task scheduling
Wireless communication
Wireless sensor networks
ISSN:2379-1276
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent years, the number of Internet of Things (IoT) devices/sensors has increased to a great extent. IoT is expected to connect billions of devices and humans in order to promote promising advantages. To support the computational demand of real time latency sensitive applications of largely geo-distributed IoT devices/sensors, a new computing paradigm named "Fog computing" has been introduced. Generally, Fog computing resides closer to the IoT devices/sensors and extends the Cloud based computing, storage and networking facilities. A fog node receives a large number of tasks that need to be executed before their deadline, therefore, task scheduling in Fog computing systems has become an important subject for research.In this paper, we propose new task scheduling algorithms called RTFIFO, MinJF and MinRes in order to optimize the number of tasks rejected by a fog node. Extensive simulations show that the proposed algorithms have better performance than some existing task scheduling approaches.
ISSN:2379-1276
DOI:10.1109/WOCC53213.2021.9603112