Cloud computing refers to a sophisticated technology that deals with the manipulation of data in internet-based servers dynamically and efficiently. The utilization of the cloud computing has been rapidly increased because of its scalability, accessibility, and incredible flexibility. Dynamic usage and process sharing facilities require task scheduling which is a prominent issue and plays a significant role in developing an optimal cloud computing environment. Round robin is generally an efficient task scheduling algorithm that has a powerful impact on the performance of the cloud computing environment. This paper introduces a new approach for round robin based task scheduling algorithm which is suitable for cloud computing environment. The proposed algorithm determines time quantum dynamically based on the differences among three maximum burst time of tasks in the ready queue for each round. The concerning part of the proposed method is utilizing additive manner among the differences, and the burst times of the processes during determining the time quantum. The experimental results showed that the proposed approach has enhanced the performance of the round robin task scheduling algorithm in reducing average turn-around time, diminishing average waiting time, and minimizing number of contexts switching. Moreover, a comparative study has been conducted which showed that the proposed approach outperforms some of the similar existing round robin approaches. Finally, it can be concluded based on the experiment and comparative study that the proposed dynamic round robin scheduling algorithm is comparatively better, acceptable and optimal for cloud environment.

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.