Analysis of Round Robin Scheduling Algorithms in CPU Scheduling for Smart Application

Abstract

CPU scheduling is the primary task under the process management system for any application such as electronics
industries, e-health care systems, e-transportation, etc. It is one of the simplest and indispensable functions of any
operating system. It is a method used by the operating system in multi-programming systems to schedule tasks on the
CPU to get the most out of it. To schedule the operations, the operating system employs a number of scheduling
algorithms. Round-robin scheduling is a favorable choice for time-sharing systems amongst all existing traditional
process scheduling algorithms. We examined six current versions of the classic round-robin algorithm, in this study to
determine which one is best for decreasing the average of Turn Around Time (TAT), Waiting Time (WT), and total
context switching figures by building and testing them in various circumstances.