Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling

Abstract: The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and intelligent round robin algorithms. In real time algorithm, round robin plays a significant role to be use in embedded systems. Here we compare the number of context switching, average turn around time, average waiting time between the two. Intelligent round robin algorithm, is an algorithm with dynamic time quantum. The quantum is calculated and the quantums can be different between tasks. While in simple round robin algorithm, the quantum is the same for every tasks. This comparison proves that intelligent round robin algorithm is more efficient, with lower context switching and lower average turn around time and lower average waiting time. There by this increases the system throughput.

Keywords: Round Robin Algorithm, Intelligent Round Robin Algorithm, Average Turn Around Time, Average Waiting Time, Quantum