SG-PBFS: Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment

Job scheduling in cloud computing plays a crucial role in optimizing resource utilization and ensuring efficient job allocation. But cloud resources may be wasted, or service performance may suffer because of under-utilization or over-utilization because of poor scheduling. Existing approaches often overlook the dynamic nature of cloud environments, resulting in issues like missed deadlines, prolonged flowtime, extended makespan, and unacceptable total tardiness. To address this issue, the main objective of this research is to improve the existing Priority Rules (PR) cloud schedulers by developing a new dynamic scheduling algorithm by manipulating the gaps in the cloud job schedule. Firstly, a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs can access the required resources at optimal times. Then, a backfilling strategy called Shortest Gap -Priority-Based Fair Scheduling (SG-PBFS) is developed that attempts to manipulate the gaps in the schedule of cloud jobs. Finally, the performance evaluation demonstrates that the proposed SG-PBFS algorithm outperforms SG-SJF, SG-LJF, SG-FCFS, SG-EDF, and SG-(MAX-MIN) regarding flow time, makespan time, and total tardiness, which conclusively demonstrates its effectiveness. To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.(c) 2023 Elsevier B.V. All rights reserved.