Improved Group Based Time Quantum (IGBTQ) CPU scheduling algorithm

The Round Robin (RR) CPU scheduling algorithm is a fair scheduling algorithm that gives equal time quantum to all processes. The decision on how to select the time quantum is extremely important because the time quantum has a great effect on the algorithm's performance. This paper introduces an algorithm called Improved Group Based Time Quantum with Controlled Pre-emption (IGBTQ) that further improves on the Group Based Time Quantum (GBTQ) Round Robin algorithm. This algorithm (IGBTQ) is implemented and evaluated against Classical Round Robin (RR), Dynamic Round Robin with Controlled Pre-emption (DRRCP) and Group Based Time Quantum (GBTQ) Round Robin algorithms by using Gaussian and Uniform statistical distribution functions to generate the burst times of the processes. The improved algorithm (IGBTQ) is better than the other three scheduling algorithms under consideration (RR, GBTQ and DRRCP) for systems that adopt RR CPU scheduling.