Task-Optima Framework: Enabling Dynamic Cloud Task Scheduling Strategies
Аннотация
Abstract Cloud computing (CC) providers face a significant challenge in efficiently utilizing resources because system functionality and efficiency are directly impacted by optimal task scheduling. Scalability and efficiency are challenging to achieve because of the nonpolynomial time complexity of these problems and the complexity of scheduling virtual machines (VMs) in dynamic cloud environments. Conventional approaches frequently fall short, which raises the possibility of resource overloading or underuse, which can result in system failures. This research proposed a novel method for task scheduling in cloud environments, called the task-optima scheduling framework, to address these issues. To handle the heterogeneity, independence, and nonpreemptive nature of the tasks, this framework uses a sequential scheduling technique to execute multiple tasks on the same virtual machine. While virtual machines are sorted in descending order, tasks are prioritized and arranged in ascending order. To optimize job scheduling on virtual machines (VMs), a cloud broker employs a hybrid spider monkey optimization-simulated annealing (SMO-SA) algorithm. The main optimization method is SMO, and SA is occasionally applied to balance extraction and exploration in the solution space. The schedule is continuously improved through this iterative process, which lasts until a predetermined termination criterion is satisfied. By avoiding local optima, the hybrid approach reduces complexity and improves the search process by being flexible enough to adjust to changes in workload. The result reveals the proposed method achieved a makespan of 120 s, a computation time of 6 ms, and a Success rate of 98% compared to previous methods. Task scheduling in CC environments can be made flexible and reliable with the help of the objective function, which evaluates the overall effectiveness of the schedule created by the SMO-SA methodology.