Article Per Year (5 Year)
p-Index From 2020 - 2025
2.873
P-Index
This Author published in this journals
All Journal Indonesian Journal on Computing (Indo-JC) IJoICT (International Journal on Information and Communication Technology) Sinkron : Jurnal dan Penelitian Teknik Informatika IJISTECH (International Journal Of Information System & Technology) Journal of Computer System and Informatics (JoSYC) IJISTECH eProceedings of Engineering Telkatika: Jurnal Telekomunikasi Elektro Komputasi & Informatika Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) LOGIC: Jurnal Penelitian Informatika
Siti Amatullah Karimah
Telkom University
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Social Sciences

Published : 22 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Sinkron : Jurnal dan Penelitian Teknik Informatika

 1 
Performance Analyze of Fog Computing Against Topology Using YAFS Fog Simulator Adiansyah, Naufal Rafi; Karimah, Siti Amatullah; Mugitama, Satria Akbar
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12659

Abstract

This research focuses on the analysis of fog computing performance on mesh, star, and ring topologies using the YAFS Fog Simulator. The reason YAFS (Yet Another Fog Simulator) was chosen was based on the consideration that this fog computing simulator, among other things, was designed to analyze topology and load balancing as well as include processing time for data transfer between devices into the fog layer. In addition, YAFS has a better level of time processing accuracy than other fog simulators. There are three test scenarios with additional load which includes 4, 8, and 12 fog nodes in each topology. Each scenario also has an additional load which includes 4, 8, and 12 devices in the form of sensors and actuators, respectively. The experimental results from the three scenarios show that the greater the load from the fog node and equipment, the longer the processing time will be. In addition, the results of the three scenarios also show that the mesh topology has the best time processing accuracy among the three tested topologies.
Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS Nurcahya, Dimas; Karimah, Siti Amatullah; Mugitama, Satria Akbar
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2023): Article Research Volume 7 Issue 3, July 2023
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v8i3.12682

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.
Co-Authors Adiansyah, Naufal Rafi Aji G. Putrada Aji Gautama Putrada Anwar, Syafrullah Arafah Mufti, Azizurahman Azizurahman Arafah Mufti Bayu Arifat Firdaus Dawani, Febri Devina Adinda Hartono Endang Rosdiana Erwid Musthofa Jadied Fiqqih Maulana Susanto Haris Hamdani Latif Heriaji, Galih Wimba Hilal Hudan Nuha Jadied, Erwid M Khatami, Muhammad Komara, Hauzan Jiyad Dhoifullah Lazuardi, Hafidz Muhammad Arief Nugroho Nurcahya, Dimas Sabiq, Ahmad Thariq Satria Akbar Mugitama Setyorini SETYORINI Sidik Prabowo St. Nur Hikmah Damayanti Syafwan Almadani Azra Vera Suryani Wibowo, Gilang Adhi Windu Firmansyach Yahya Ermaya