Dynamic Backfilling Algorithm to Increase Resource Utilization in Cloud Computing

Abstract

In this article, the authors propose a novel backfilling-based task scheduling algorithm to schedule deadline-based tasks. The existing backfilling algorithm has some performance issues in comparison with the number of task scheduling in OpenNebula cloud platform. A lease could not be scheduled if it is not sorted with respect to its start time. In backfilling, a lease is selected in First Come First Serve (FCFS) to be backfilled from the queue in which some ideal resources can be found out and allocated to other leases. However, the scheduling performance is not better if there are similar types of leases to backfill. It requires a decision maker to resolve conflicts. The proposed approach schedules the number of tasks without any decision maker. An additional queue and the current time of the system is implemented to improve the scheduling performance. It performs quite satisfactorily in terms of number of a leases scheduling, and resource utilization. The performance result is compared with the existing backfilling algorithms.