Improvised Round Robin scheduling Algorithm with the Calculated Time Quantum

The Objective of the study is to provide a organized approach by assigning calculated time quantum for the round robin scheduling algorithm. For the execution of the round robin algorithm accepts a time quantum, paper proposes a method of calculating a time quantum using the standard deviation of the process burst time. We are aware that standard deviation calculates the variations between the processes and this variation is used to calculate the time quantum. The paper shows the calculation. The paper uses the concept of grouped data and the performance of the execution of the process also effected using a new method of calculating the new time quantum. There are some research papers are considered and various algorithms are discussed related to Round Robin, Shortest job first etc. In this paper the result shows the completion time is reduced compared to the random way of calculating the quantum time.