Performance Analysis of FIFO and Round Robin Scheduling Process Algorithm in IoT Operating System for Collecting Landslide Data

Abstract

Scheduling is one of the most important factors used in scheduling processes insideCPU. CPU scheduling is a concept of multiprogramming, where the CPU is used to schedule the incoming processes alternately. Many algorithms can be used to schedule processesinside CPU, but not all can be real-time. Long waiting times and response times often be problems in scheduling processes in realtime. FIFO and Round Robin algorithms can be implemented to schedule the processes in realtime. In this paper, the authors schedule the process of several sensors that are used to collect landslide data. The data processing is sent by FIFO scheduling and Round Robin scheduling separately on the Internet of Things (IoT) device. The author only analyzes the performance of FIFO and Round Robin algorithms in scheduling the incoming processes in real-time on the IoT operating system by considering the waiting time and response time. The analysis is expected to create a quick response time and waiting time so that proper algorithm is decided to complement the IoT architecture in landslide detection. The FIFO and Round Robin algorithms are implementedat the Raspbian and Arch Linux operating systems in the IoT device, the Raspberry Pi 3 Model B, which uses a 64-bit 64-bit ARM Cortex-AS3 64-bit process at 1.2GHz.