International Journal of Networked and Distributed Computing

Volume 9, Issue 1, January 2021, Pages 59 - 74

Scheduling Algorithms in Fog Computing: A Survey

Authors
Khaled Matrouk*, Kholoud Alatoun
Department of Computer Engineering, Faculty of Engineering, Al-Hussein Bin Talal University, Ma’an, 71111, Jordan
*Corresponding author. Email: khaled.matrouk@ahu.edu.jo
Corresponding Author
Khaled Matrouk
Received 30 April 2020, Accepted 14 July 2020, Available Online 25 January 2021.
DOI
https://doi.org/10.2991/ijndc.k.210111.001How to use a DOI?
Keywords
Fog computing, scheduling algorithms, task scheduling, job scheduling, workflow scheduling, resource allocation, IoT applications
Abstract

Over the last recent years, applications related to the internet of things have become the most important techniques in the world that facilitate interactions among humans and things to enhance the quality of life. So, the number of devices used in these applications will increase, leading to the creation of huge amounts of data. Cisco proposed fog computing in 2012, which located between the end-users (Internet of Things devices) and cloud computing. Fog computing is not a replacement for cloud computing, but it reduces the drawbacks of cloud computing, makes it efficient and provides storage and computing services at the edge of the internet. Resource management is the key factor that decides the performance of fog computing. Whereas scheduling plays an important role in managing resources in fog computing, task scheduling is the ability to map tasks to the appropriate resources in fog computing. The task is a small part of a work that must be performed within a specific time. Because fog computing contains heterogeneous and distributed resources, task scheduling becomes complex. Task scheduling is an NP-hard problem that needs to apply effective task scheduling strategies to reach an ideal solution. There were many proposed algorithms about scheduling in the previous years; most of them were applied in cloud computing, while the minority were applied in fog computing. This paper aims to comprehensively review and analyze the most important up-to-date scheduling algorithms in fog computing.

Copyright
© 2021 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)
View full text (HTML)

Journal
International Journal of Networked and Distributed Computing
Volume-Issue
9 - 1
Pages
59 - 74
Publication Date
2021/01
ISSN (Online)
2211-7946
ISSN (Print)
2211-7938
DOI
https://doi.org/10.2991/ijndc.k.210111.001How to use a DOI?
Copyright
© 2021 The Authors. Published by Atlantis Press B.V.
Open Access
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - JOUR
AU  - Khaled Matrouk
AU  - Kholoud Alatoun
PY  - 2021
DA  - 2021/01
TI  - Scheduling Algorithms in Fog Computing: A Survey
JO  - International Journal of Networked and Distributed Computing
SP  - 59
EP  - 74
VL  - 9
IS  - 1
SN  - 2211-7946
UR  - https://doi.org/10.2991/ijndc.k.210111.001
DO  - https://doi.org/10.2991/ijndc.k.210111.001
ID  - Matrouk2021
ER  -