A New Enhanced IGBTQ-based Model for CPU Scheduling

Abstract

CPU scheduling is concerned with how to efficiently exploit processors by executing the largest number of operations in the shortest possible time. The efficiency of CPU scheduling depends on the algorithm used. Round Robin (RR) is one of the most popular algorithms, which is primarily based on determining the period of execution time for the operation. In this work, we develop a new enhancement algorithm for modifying the RR algorithm based on IGBTQ model to solve the CPU scheduling problem. Therefore, the main objective is to improve the Average waiting Time (AWT) and the Average Turnaround Time (ATT). The final results are successful when reached the lowest scores of AWT and ATT measurements. The experiments used two cases of a different number of processes, which obtained better outputs compared to other state-of-the-art models like; the dynamic RR with Control Preemption (DRRCP), Group Based Time Quantum (GBTQ), and IGBTQ algorithm.