Published Paper Details:

CPU scheduling has vital effect on the resources, their utilization and overall performance of the systems. Round Robin (RR) scheduling algorithm is widely used in multitasking. Choosing the time quantum in RR algorithm is very crucial as a small time slice results in large number of context switches and large time quantum increases the response time and makes it more similar to First Come First Serve (FCFS) scheduling algorithm. A CPU scheduling processor is said to be optimally if it has a higher throughput, low waiting time, lower turnaround time and less number of context switches for the processes coming for execution. The main objective of this paper is to improve the working of round robin scheduling by dynamic time quantum adjustment along with the integrated priority scheduling algorithm. The time quantum is decided based on the number of process. If the number of process is less than or equal to 3 then normal FCFS approach along with priority, else time quantum will be number of process divided by 2. The ready queue has the processes in order of priority. The process that arrives first will have to priority as 1 by default. The scheduler will run same as round robin until the remaining burst time is less than or equal to the actual time quantum. In such case the process is allowed for full execution.The proposed algorithm produces better average turnaround time, average waiting time and fewer number of context switches than existing algorithms which is shown by the experimental analysis.