A Novel Approach For Scheduling

Scheduling is the central concept used in operating system. It helps in choosing the processes for execution. There are many scheduling algorithms available for a multi-programmed operating system like FCFS, SJF, Priority, Round Robin etc. We mainly focused on Round Robin scheduling algorithm. We proposed a new algorithm as titled "A NOVEL APPROACH FOR SCHEDULING". It is the combination of Round Robin scheduling algorithm and Dynamic Time Quantum. We get better result in terms of Waiting Time, Turnaround Time and number of Context Switch than the Round Robin scheduling algorithm using static time quantum, Average Mid Max Round Robin scheduling algorithm and Min-Max Round Robin scheduling algorithm.