A Best Possible Time Quantum for Advanced Round Robin with Shortest Job First Scheduling Algorithm

CPU is the most important resource of computer. To control the sequence of invoking processes of CPU some scheduling algorithms are used. The aim of this algorithms are to reduce waiting time, turnaround time, context switch and CPU utilization. One of them is Round Robin which is mostly used in time shared system because each process is given a fix amount of time to execute processes. but effectiveness of this algorithm depends upon choice of Quantum time. It plays very important role for scheduling, if time is too small then context switch become very high and if it is very big then it will work as FCFS scheduling algorithm. In this paper I have discuss about the selection of quantum time, for that I have introduce a new formula which will help to reduce average waiting time, Turn around time and also context switch. As I have analyzed and tested, it give better performance than Round Robin(RR), IRR(Improved Round Robin), IRRSJF(Improved Round Robin with Shortest Job First),SARR(Self Adjust Round Robin).