An efficient average execution time-round-robin (AET-RR) scheduling algorithm

Scheduling is a well known term in the field of operating system which allows processes for execution. Round-robin ( RR ) performs better in the time-shared system; as each process allows for execution within a specific time slot i.e time quantum ( TQ ). The effectiveness of RR scheduling depends on the value of TQ . For further performance enhancement, an efficient average execution time-round-robin ( AET-RR ) algorithm has been proposed for both online and offline scenario with varying TQ . Both the proposed algorithms (for online and offline) has been thoroughly explained through block diagram, flowchart and example. The experimental analysis shows that our proposed AET-RR algorithm performs better as compared to a conventional RR algorithm in terms of average turnaround time ( ATAT ), average waiting time ( AWT ) and number of context switch ( NCS ) with increasing burst time ( BT ).