Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS

Authors

  • Dimas Nurcahya Informatics, School of Computing, Telkom University, Bandung, Indonesia
  • Siti Amatullah Karimah Informatics, School of Computing, Telkom University, Bandung, Indonesia
  • Satria Akbar Mugitama Informatics, School of Computing, Telkom University, Bandung, Indonesia

DOI:

10.33395/sinkron.v8i3.12682

Keywords:

Fog Computing, Round Robin, Priority Scheduling, Processing Time, Time Efficiency

Abstract

A smart device that has seen more development is the Internet of Things (IoT). An IoT system implementation requires a device that can accept and handle various sorts of data. Fog Computing is a solution to the issue since the IoT demands a device that can provide Real-Time. Certainly, load balancing involves scheduling the IoT devices and data used. Because Cloud and Fog Computing models enable data growth management and deployment planning, which necessitate a quicker response from platforms and applications, processing power scheduling is essential. The purpose of this study is to evaluate the performance of effective scheduling algorithms that adhere to these computing models platform requirements. The scheduling algorithm that can produce the lowest Processing Time and the resulting Time Efficiency is more efficient can be called the best scheduling algorithm. In this research, the author analyzes the performance of scheduling algorithms in the form of Round Robin and Priority Scheduling on Fog Computing. In this research, testing was carried out by creating a scenario of the effect of increasing the number of Fog Nodes and Devices used. The average result of scenario testing obtained for processing time for Round Robin is lower, and the highest Time Efficiency for Round Robin over Priority Scheduling is 11%. With these test results, the Round Robin scheduling algorithm has a simpler level of complexity. So, it can be concluded that Round Robin belongs to the category of the best scheduling algorithm in this case.

GS Cited Analysis

Downloads

Download data is not yet available.

Author Biographies

Dimas Nurcahya, Informatics, School of Computing, Telkom University, Bandung, Indonesia

 

 

Satria Akbar Mugitama, Informatics, School of Computing, Telkom University, Bandung, Indonesia

 

 

 

References

Abdali, T. A. N., Hassan, R., Aman, A. H. M., & Nguyen, Q. N. (2021). Fog Computing Advancement: Concept, Architecture, Applications, Advantages, and Open Issues. IEEE Access, 9, 75961–75980. https://doi.org/10.1109/ACCESS.2021.3081770

Choudhari, T., Moh, M., & Moh, T. S. (2018). Prioritized task scheduling in fog computing. Proceedings of the ACMSE 2018 Conference, 2018-January. https://doi.org/10.1145/3190645.3190699

de Donno, M., Tange, K., & Dragoni, N. (2019). Foundations and Evolution of Modern Computing Paradigms: Cloud, IoT, Edge, and Fog. IEEE Access, 7, 150936–150948. https://doi.org/10.1109/ACCESS.2019.2947652

Guevara, J. C., & da Fonseca, N. L. S. (2021). Task scheduling in cloud-fog computing systems. Peer-to-Peer Networking and Applications, 14(2), 962–977. https://doi.org/10.1007/s12083-020-01051-9

IEEE Staff. (2019). 2019 SoutheastCon. IEEE.

Jin, X., & Yu, L. (2022a). Research and implementation of high priority scheduling algorithm based on intelligent storage of power materials. Energy Reports, 8, 398–405. https://doi.org/10.1016/j.egyr.2022.03.126

Jin, X., & Yu, L. S. (2022b). Research and implementation of high priority scheduling algorithm based on intelligent storage of power materials. Energy Reports, 8, 398–405. https://doi.org/10.1016/j.egyr.2022.03.126

Lera, I., Guerrero, C., & Juiz, C. (2019a). YAFS: A Simulator for IoT Scenarios in Fog Computing. IEEE Access, 7, 91745–91758. https://doi.org/10.1109/ACCESS.2019.2927895

Lera, I., Guerrero, C., & Juiz, C. (2019b). YAFS: A Simulator for IoT Scenarios in Fog Computing. IEEE Access, 7, 91745–91758. https://doi.org/10.1109/ACCESS.2019.2927895

Mahmood Ibrahim, I., MSadeeq, M. A., M Zeebaree, S. R., Shukur, H. M., Jacksi, K., Radie, A. H., Maseeh Yasin, H., & Najat Rashid, Z. (2021). Task Scheduling Algorithms in Cloud Computing: A Review. In Turkish Journal of Computer and Mathematics Education (Vol. 12, Issue 4).

Margariti, S. v., Dimakopoulos, V. v., & Tsoumanis, G. (2020). Modeling and simulation tools for fog computing-A comprehensive survey from a cost perspective. Future Internet, 12(5). https://doi.org/10.3390/FI12050089

Murad, S. A., Muzahid, A. J. M., Azmi, Z. R. M., Hoque, M. I., & Kowsher, M. (2022). A review on job scheduling technique in cloud computing and priority rule based intelligent framework. In Journal of King Saud University - Computer and Information Sciences (Vol. 34, Issue 6, pp. 2309–2331). King Saud bin Abdulaziz University. https://doi.org/10.1016/j.jksuci.2022.03.027

Neware, R. (2019a). Fog Computing Architecture, Applications and Security Issues: A Survey. https://doi.org/10.20944/preprints201903.0145.v1

Neware, R. (2019b). Fog Computing Architecture, Applications and Security Issues: A Survey. https://doi.org/10.20944/preprints201903.0145.v1

Perez Abreu, D., Velasquez, K., Curado, M., & Monteiro, E. (2020). A comparative analysis of simulators for the Cloud to Fog continuum. Simulation Modelling Practice and Theory, 101. https://doi.org/10.1016/j.simpat.2019.102029

PHORNCHAROEN, S., & SA-NGIAMVIBOOL, W. (2018). A proposed round robin scheduling algorithm for enhancing performance of CPU utilization. Przeglad Elektrotechniczny, 94(4), 34–38. https://doi.org/10.15199/48.2018.04.07

Sabireen, H., & Neelanarayanan, V. (2021). A Review on Fog Computing: Architecture, Fog with IoT, Algorithms and Research Challenges. ICT Express, 7(2), 162–176. https://doi.org/10.1016/j.icte.2021.05.004

Sakshi, Sharma, C., Sharma, S., Kautish, S., A. M. Alsallami, S., Khalil, E. M., & Wagdy Mohamed, A. (2022). A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time. Alexandria Engineering Journal, 61(12), 10527–10538. https://doi.org/10.1016/j.aej.2022.04.006

Singer, K., Goldstein, N., Muller, S. K., Agrawal, K., Lee, I. T. A., & Acar, U. A. (2020). Priority Scheduling for Interactive Applications. Annual ACM Symposium on Parallelism in Algorithms and Architectures, 465–477. https://doi.org/10.1145/3350755.3400236

Singh, J., Singh, P., & Gill, S. S. (2021). Fog computing: A taxonomy, systematic review, current trends and research challenges. In Journal of Parallel and Distributed Computing (Vol. 157, pp. 56–85). Academic Press Inc. https://doi.org/10.1016/j.jpdc.2021.06.005

Tychalas, D., & Karatza, H. (2020). An Advanced Weighted Round Robin Scheduling Algorithm. ACM International Conference Proceeding Series, 188–191. https://doi.org/10.1145/3437120.3437304

Downloads


Crossmark Updates

How to Cite

Nurcahya, D. ., Karimah, S. A., & Mugitama, S. A. . (2023). Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 1677-1686. https://doi.org/10.33395/sinkron.v8i3.12682

Issue

Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023

Section

Articles

License

Copyright (c) 2023 Dimas Nurcahya, Siti Amatullah Karimah, Satria Akbar Mugitama

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Crossref
Scopus
Google Scholar
Europe PMC