Priority based Scheduling Algorithm using Divisible Load Theory in Cloud

Cloud computing is a technology that works on a distributed network. It delivers computation, network, and storage as a service instead of a product, where the resources are shared and provided to the end-users’ devices. The user has to pay based on his/her consumptions. In cloud computing, entities are mainly users, service providers, and scheduling systems. The scheduler in the algorithm should arrange the jobs in such a way that the utilization of resources should be maximized and simultaneously improving quality at a reasonable cost. In the existing job scheduling process, the algorithm uses the divisible load theory to divide a large workload among the available processors. The proposed work is to modify the scheduling algorithm based on separating loads dynamically and avoiding failure. This work is done using the Cloud Simulator (CloudSim), which is a framework for simulating Cloud computing scheduling algorithms. It provides the ambiance for the creation of data centers, instances of virtual machines, user applications and computational principles and policies for managing several parts of the system.