Priority-Induced Round-robin scheduling algorithm with dynamic time quantum for Cloud computing environment

Cloud computing provides a virtual platform that allows resources to be accessed through the Internet. As cloud environment needs to serve multiple requests, efficient task scheduling is required to maintain its performance. Round Robin Scheduling algorithm is one of the most employed algorithms for task scheduling in cloud environment. In this paper, an improved Round Robin algorithm has been proposed. The proposed algorithm introduces dynamic time quantum and priority for scheduling the tasks. It is carried out by categorizing the tasks based on their urgency to complete the task from the ready queue. A comparative study is also established and inferred that the proposed algorithm is comparatively enhanced and is optimum for the Cloud Computing environment.