Dynamic Time Quantum Priority Based Round Robin for Load Balancing In Cloud Environment

Abstract

Load balancing plays an important role in cloud computing environment. A better load balancing algorithm provides more efficient service and improves cloud computing performance. In this paper, a new dynamic time quantum priority-based algorithm has been proposed which is suitable for load balancing in cloud computing environment. Round Robin is a very simple algorithm in cloud computing environment but the disadvantage of round robin algorithm is long waiting time, long response time and overhead for context switches. In this paper, we have proposed a new dynamic round robin algorithm with execution time slice which is used to determine dynamic time quantum (TQ) for individual service request in every round. Here the priority has been used to calculate the Priority Component (PC) of the process. Our experimental result gives the better performance in term of minimizing average waiting time, total number of context switches and average turnaround time.