Utilizing Divisible Load Scheduling Theorem in Round Robin Algorithm for Load Balancing In Cloud Environment

Cloud Computing is a newly paradigm in computing that promises a shift from an organization required to invest heavily for limited IT resources that are internally managed, to a model where the organization can buy or rent resources that are managed by a cloud provider, and pay peruse. With the fast growing of cloud computing one of the areas that is paramount to cloud computing service providers is the establishment of an effective load balancing algorithm that assigns tasks to best Virtual Machines(VM) in such a way that it provides satisfactory performance to both, cloud users and providers. Among these load balancing algorithms in cloud environment Round Robin (RR) algorithm is one of them. In this paper firstly analysis of various Round Robin load balancing algorithms is done. Secondly, anew Virtual Machines (VM) load balancing algorithm has been proposed and implemented; i.e. ‘Divisible Weighted Round Robin(DWRR) Load Balancing Algorithm’. This proposed load balancing algorithm utilizes the Divisible Load Scheduling Theorem in the Round Robin load balancing algorithm. In order to evaluate the performance of this proposed algorithm (DWRR) the researcher used a simulator called CloudSim tool to conduct a test on the performances between the proposed algorithm (DWRR) and the types of Round Robin algorithms. After a thoroughly comparison between these algorithms, the results showed that DWRR outperforms the various types of Round Robin(Weighted Round Robin and Round Robin with server affinity )algorithms in terms of execution time (makespan) with the least complexity. Keywords: Scheduling Algorithm, performance, cloud computing, load balancing algorithm, Divisible Load scheduling Theory