Determining proficient time quantum to improve the performance of round robin scheduling algorithm

Process scheduling is considered as a momentous and instinct task accomplished by operating system. Round robin is one of the extensively utilized algorithms for scheduling. Various noticeable scheduling algorithms based on round robin strategy have been introduced in last decade. The most sensitive issue of round robin algorithm is time quantum because it determines and controls the time of achieving resources for a process during execution. Different types of approaches are available for determining time quantum related to round robin. This paper represents a new round robin algorithm having proficient time quantum that has been determined by considering the maximum difference among differences of adjacent consecutive processes into the ready queue. The proposed methodology is an endeavor to increase the outcomes of round robin as well as system performance. The algorithm is experimentally and comparatively better than the mentioned round robin algorithms in this paper. From the consideration against the referred algorithms, it decreases average turn-around-time, average waiting-time and the number of context-switching along with other CPU scheduling criteria.