TL;DR
A cyclic feedback scheduling optimization strategy is proposed and a reasonable termination condition for the cyclic strategy based on theoretical derivation is designed and Experimental results show that the proposed method can effectively shorten task scheduling time.
A random forest enhanced particle swarm optimization algorithm (RFPSO) is proposed, which implements intelligent initialization of resource allocation through a random forest model, which improves the efficiency of finding optimal solutions and ensures that critical tasks can prioritize access to higher-performance computing resources.
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.
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.
Experiments show that the proposed Hybrid Framework for Joint Optimization of Resource Allocation and Load Balancing that spans two layers in heterogeneous cloud computing systems obtains 25-30% energy savings compared with ordinary methods, significantly reduces p95 latency and also achieves a relatively better Quality Of Service.
A distributed Multi-stage Adaptive Deferred Acceptance (MA-DA) algorithm is proposed that enables a stable and Pareto-optimal assignment of tasks to edge computing nodes (ECNs) and determines a reasonable task execution sequence and ensures the prioritized completion of delay-sensitive tasks.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
