Skip to content
Open access

SPES: A Stochastic Predictive Energy-Aware Scheduling Approach for Efficient Multi-Region Cloud Computing

Jul 2026 · Electronics · 0 citations · 44 references

Abstract

Cloud computing has transformed the delivery of modern applications and services by providing scalable, flexible, and cost-effective access to computing resources. One of the most critical challenges in cloud environments is the efficient distribution of dynamic workloads across heterogeneous resources, commonly addressed through load balancing and task scheduling techniques. Efficient scheduling plays a vital role in maximizing resource utilization, minimizing response time, and maintaining acceptable Quality of Service (QoS), particularly under dynamic and large-scale workloads. Despite the progress achieved by traditional heuristics such as Min-Min and metaheuristic approaches like the Improved Sparrow Search Algorithm (ISSA), challenges related to scalability, adaptability, and computational overhead remain. Metaheuristic-based approaches often involve iterative optimization processes that may limit their efficiency in real-time scheduling scenarios. In this paper, we propose a lightweight Stochastic Predictive Energy-Aware Scheduling (SPES) algorithm that integrates predictive execution estimation, multi-resource awareness, and stochastic decision-making. Unlike deterministic scheduling strategies, SPES employs a Top K candidate selection mechanism combined with probabilistic weighting and epsilon-greedy exploration to enhance adaptability and avoid suboptimal resource allocation. The proposed method considers CPU, memory, and I/O demands to achieve balanced utilization across heterogeneous hosts while implicitly addressing energy efficiency through utilization-based modeling. The proposed algorithm is implemented and evaluated using the CloudSim 5.0 simulation framework under heterogeneous multi-region cloud environments with varying workload sizes. Experimental results demonstrate that SPES consistently outperforms ISSA and achieves makespan reductions of up to 23.8% while improving scalability, resource utilization, and scheduling efficiency under dynamic cloud workloads. These results indicate that SPES provides an effective lightweight scheduling solution for large-scale and energy-aware cloud computing environments and supports green computing objectives through improved resource efficiency.

Read PDF

Similar papers

Open access Jul 2026

GPS: A Lightweight Greedy-Predictive Scheduling Approach for Energy-Aware Multi-Region Cloud Computing

A lightweight Greedy Predictive Scheduling (GPS) algorithm that combines predictive resource utilization estimation with greedy host selection to improve scheduling decisions across heterogeneous multi-region cloud environments is proposed.

M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al. · 0 citations
Open access 2026

Efficient Algorithm for Multi-Objective Dynamic Resource Allocation in Cloud Computing

The design and development of DynamiCloud is presented, a scalable and computationally efficient multi-objective dynamic resource allocation model for cloud computing that can simultaneously optimize multiple conflicting objectives such as throughput, Service Level Agreement compliance, and power efficiency.

Onwuegbuchulem Gift., Bennett, E.O., Matthias D. et al. · 0 citations
Open access Jul 2026

Masterpiece Optimization Algorithm-Based Priority-Aware Load Balancing Strategy for Cloud Data Centers

: Cloud Computing (CC) is one of the widely used technologies due to its advanced features such as pay-per-use, scalability, and flexibility. The primary objective of CC is to allow users to access and purchase cloud services that are on demand through internet-based applications. Efficient load-balancing in the cloud faces challenges of high-dimensional state spaces and scalability with increasing tasks. To solve this problem, the Masterpiece Optimization Algorithm (MOA) with a priority constraint is employed for load-balancing according to the tasks efficiently. The MOA is integrated with a priority-based cost function to enhance the task scheduling process by introducing a multi-dimensional approach for load balancing. The priority-based framework helps the scheduler to dynamically recalibrate workloads. The experimental results achieve a total energy consumption of 39.8 W and an average CPU resource utilization of 99.54%, which is better than the existing algorithms, such as the hybrid Particle Swarm Grey Wolf Optimization (PSGWO) algorithm.

S. Vijaykumar, S. Chandre · 0 citations
Open access 2026

Energy-Aware Task Scheduling using Grasshopper Optimisation Algorithm

Efficient energy scheduling in heterogeneous computing environments is a critical challenge, as task allocation decisions directly affect both energy consumption and execution performance. This work presents an energy aware scheduling framework based on a discretized grasshopper optimization algorithm (GOA), designed to balance energy reduction with acceptable makespan. The model formulates scheduling as a constrained objectives optimization problem, incorporating energy use, makespan, heterogeneous resource capacities, workflow precedence, and non preemptive execution. A constant aware representation and repair based decoding strategy enable GOA to generate feasible task to resources assignments. Implemented in Python, the framework is evaluated against HEFT, Min and Random scheduling under varying workload. Results show that the schedules based on GOA achieves lower energy consumption and improved performance delay energy while maintaining competitive makespan, with performance gains becoming more pronounced as workload complexity increases. These findings demonstrate the scalability and effectiveness of discretised GOA as a metaheuristic solution for energy aware scheduling in heterogeneous systems.

Macauley Opuwari, C. Igiri, D. Ikeh · 0 citations
Open access Jul 2026

Comparative Performance and Computational Complexity Analysis of Hybrid WGO–DRL and Heuristic, Metaheuristic and Bio-Inspired Scheduling Algorithms in Cloud Computing

A hybrid scheduling framework that integrates Hybrid Wild Goose Optimization (HWGO) with Deep Reinforcement Learning (DRL) is investigated, indicating that intelligent hybrid optimization techniques can provide adaptive and efficient task scheduling solutions for modern cloud computing environments.

Annaiah H, A. Rajesh · 0 citations
Jul 2026

Energy-Efficient Hybrid Metaheuristic Resource Allocation Model for Dynamic Virtual Machine Scheduling in Cloud Computing Platforms

The findings suggest that HORAM is far better at using resources; fewer tasks are completed, and the total power consumed is lower than with traditional scheduling algorithms, suggesting the suggested architecture is a viable solution to sustainable cloud infrastructure management.

S. Balakrishnan, K. Aravind, ·. T. Veeramani et al. · 0 citations