Relative Time Quantum-based Enhancements in Round Robin Scheduling

Modern human life is heavily dependent on computing systems and one of the core components affecting the performance of these systems is underlying operating system. Operating systems need to be upgraded to match the needs of modern-day systems relying on Internet of Things, Fog computing and Mobile based applications. The scheduling algorithm of the operating system dictates that how the resources will be allocated to the processes and the Round Robin algorithm (RR) has been widely used for it. The intent of this study is to ameliorate RR scheduling algorithm to optimize task scheduling. We have carried out an experimental study where we have developed four variations of RR, each algorithm considers three-time quanta and the performance of these variations was compared with the RR algorithm, and results highlighted that these variations performed better than conventional RR algorithm. In the future, we intend to develop an automated scheduler that can determine optimal algorithm based on the current set of processes and will allocate time quantum to the processes intelligently at the run time. This way the task performance of modern-day systems can be improved to make them more efficient.