Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach

Abstract

CPU. In this paper, the static use of dynamic time quantum as CPU Time Slice is reviewed and a new algorithm for CPU scheduling named Improved Optimum Dynamic Time Slicing Round Robin Algorithm (IODTSRR) is proposed for process and thread scheduling. The proposed algorithm is based upon dynamic nature of allocation, calculation of the value of time quantum which varies according to the state of queue along with the capability of executing ready processes arriving at the same or different time. The concept of multi-threading by using Dummy Thread is introduced to hold the added processes in the queue during all arrival time intervals respectively. The performance is compared with Optimum Dynamic Time Slicing Using Round Robin (ODTSRR) and the results revealed that the proposed algorithm is much better specifically in response time and turnaround time. As process gets fully or partially executed while others arrive simultaneously, the context switch rates, waiting time and throughput improves hence resulting in optimized CPU performance. Keywords — scheduling algorithm; randomized control trial; time quantum; context and thread switching; response time; turnaround time; waiting time; fairness; multi-threading; synchronization; arrival time interval; dynamic queue; first come shortest job first (FCSJF); improved optimum dynamic time slicing round robin algorithm (IODTSRR); optimum dynamic time slicing using round robin (ODTSRR)