A Modified Round Robin Method to Enhance the Performance in Cloud Computing

Abstract

Cloud computing is a new age technology. The quality of services in the cloud depends on priority of the job, time taken to transfer the specific task, length of the task, number of CPUs available for every virtual machine and capacity of virtual machine. Previously, there were many researches done on the issue of task scheduling, about workflow and job scheduling in cloud computing. Scheduling in cloud has to cope with many issues like allocation of small request, workload characterization, different types of request, real-time allocation and provision for queuing. Throughput of the system depends on resources allocation to process which is performed by the CPU scheduling algorithms. The objective of scheduling algorithm is to minimize the waiting time, turnaround time, response time and context switching and highest degree of utilization of CPU. Round Robin is a pre-emptive algorithm which works on fixed time quantum and used in time sharing system. Round Robin is also known for its fairness task distribution and optimum utilization of CPU. In this paper, we have tried to introduce an improved Round Robin algorithm by calculating the quantum number by taking the average of burst time of all tasks which arrive at the same time and finish the execution of the tasks which have less quantum number and the task which has greater quantum number will be executed as per the existing Round Robin method. By simulating the proposed algorithm, we have observed that the waiting time and turnaround time decrease considerably.