Computation of workflow scheduling using backpropagation neural network in cloud computing: a virtual machine placement approach

Abstract

For measuring the efficiency of workflow scheduling, determining makespan and execution cost is essential. As estimating makespan and cost is difficult in a Cloud environment, designing an efficient computation of workflow scheduling remains a challenge. The Cloud resources are scaled up and down in accordance with user demand by following a scheduling policy. The scalability of the work environment is achieved through the virtualization process. Based on system experience, this paper proposes the priority-based backfilling backpropagation neural network (PBF-NN) hybrid scheduling algorithm for measuring makespan and execution cost accurately. The backfill algorithm is used to schedule tasks to the available resources. The percentage of migration is reduced when this algorithm is used compared to the First Come First Serve algorithm. Then, the Berger model is used to measure the fairness of resource allocation. The system decides task reallocation based on the fairness value. The backpropagation neural network handles the virtual machine placement process with necessary training and testing. The proposed algorithm dynamically allocates the tasks and reduces the utilization of resources. We use an experimental study to illustrate how the proposed system enables higher efficiency in cost, makespan, and performance.