A New Round Robin Algorithm for Task Scheduling in Real-time System

Abstract

The modern human life is strongly reliant on real-time systems. The operating system is one of the most significant real-time systems. To meet the demands of the future, operating systems must be upgraded. Nowadays, a lot of systems are used; like mobile applications and internet of things. Task scheduling is so important in the operating system to enhance the performance in these systems. Round Robin algorithm has been widely used in task scheduling. In this paper, a Median Mean Round Robin (MMRR) algorithm is proposed to significantly enhance the performance of the Round Robin algorithm. The proposed algorithm finds an optimal dynamic time quantum └(median+ mean)/2)┘ and generated for each cluster depending on the remaining burst time of the processes. The performance has been enhanced in terms of waiting time, turnaround time and context switching. The experimental results show that the proposed algorithm outperforms ADRR, HYRR, EDRR and MARR algorithms.