Optimizing Round Robin Algorithm in Operating System

Mother nature is full of learning metaphors that the technologists always look for imbibing into their technology innovations. Like nature schedules the seasons every year over the planet earth in a way which is necessary for survival, the designers of Operating system are also striving to schedule the processes in the most optimum way possible that is necessary to achieve the purpose of operating system. This paper studies one of the existing scheduling algorithms namely round robin algorithm and suggests the improvement in such a way to meet the needs of ever changing technologically charged world. Round Robin algorithm (like nature) is applied so as to circulate through the processor (like earth) quickly among processes (like seasons). However, the throughput of round robin depends largely on the time quantum selected and a short time quantum may end up increasing the overhead on CPU due to repeated context switching. The algorithm proposed in this paper has approached the time quantum by setting a threshold time so as to reduce the response time, average waiting time and the turnaround time as compared to traditional Round Robin algorithm. This will result in increased throughput and hence enhance the system performance.