Improving the Performance of CPU Scheduling in Interactive Systems

Abstract

This paper gives a new algorithm for round robin CPU scheduling of processes (jobs) having different arrival times. The performance parameters such as response time, average waiting time, average turnaround time, number of context switches are compared between original round robin scheduling algorithm (as discussed in standard textbooks on operating system) and our approach. We have made a time quantum fixed for a given round based on the average burst time of the number of processes present at the beginning of that round. By making time quantum dynamic we have proved that the performance gets improved as compared to the original round robin algorithm.

Keywords: CPU scheduling, Context Switching, Time Quantum, average waiting time, burst time, average turnaround time