International Journal of Computer Applications
Multi-tasking and multi-user operating system's performance depends on the efficiency of scheduling algorithm. Most commonly used round robin scheduling algorithm may not give optimal result if the burst time of processes is very high as compared to the time quantum of round robin algorithm. In this paper, context switching and turnaround time of processes is very high. In this paper, a two queue based round robin scheduling algorithm is proposed. In the proposed approach, two queues are used. One queue is exclusively used for CPU intensive processes and other queue is used for I/O intensive processes.