This research proposes a cost-aware, genetic-based task scheduling algorithm tailored for fog-cloud environments, which seeks to improve cost efficiency for real-time applications with strict deadlines, and demonstrates that the proposed algorithm surpasses existing techniques like Round-Robin and Trade-off algorithms.
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.
M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al.· Electronics· 0 citations
Cloud computing has become a dominant paradigm for delivering scalable and flexible on-demand resources; however, efficiently executing high performance computing (HPC) workloads remains challenging, particularly in heterogeneous environments. Conventional static scheduling methods often lead to poor resource utilization and increased makespan, while dynamic approaches improve load distribution but introduce significant overhead due to continuous monitoring and real-time decision-making. To address these challenges, this paper proposes an SLA-aware Dynamic Enhanced Resource-Aware Load Balancing Algorithm (SLADE- RALBA). The algorithm minimizes load imbalance by considering the computational capacities of virtual machines and ensures Service Level Agreement (SLA) compliance through a three-tier priority-based workflow. The proposed approach is evaluated using CloudSim Plus on two benchmark datasets: Heterogeneous Computing Scheduling Problem (HCSP) instances and the Google Cloud Jobs dataset. Results demonstrate that SLA-DE-RALBA consistently outperforms baseline algorithms, including RALBA, DRALBA, DE-RALBA, SLA-RALBA, Dynamic Max- Min, PSSLB, and PSSELB, across key metrics such as makespan, resource utilization, job rejection, throughput, execution time, and cost. Notably, it achieves zero job rejection, reduces energy consumption by up to 85%, improves resource utilization by 11.9%, lowers makespan by 41-45%, and decreases execution time by up to 57%, making it a robust and efficient solution for HPC workload scheduling in cloud environments.
Mohsin Nawaz, Altaf Hussain, Marran Al Qwaid et al.· Computer Science and Informa...· 0 citations
This paper proposes a QoS-aware and energy-efficient metaheuristic optimization-based service placement strategy for an integrated IoT and fog computing environment to improve QoS and demonstrates that the developed hybrid algorithm reduces energy consumption by 3.09% and minimize network usage significantly compared with baselines.
Pallavi Mettupalli Venkata, Thatikonda Supraja, Priyanka Chawla et al.· Journal of Supercomputing· 0 citations
An energy-and fairness-aware task offloading (EFATO) scheme through a GA to achieve the optimal task scheduling and loading within multiple edge servers and a novel fitness function is proposed that combines energy cost, computational delay and fairness index.
V. Sureshkumar, A. A. Farvin, P. R. Jayanth Hariharan et al.· Proceedings of the 1st Inter...· 0 citations
A lightweight, QoS-aware service placement algorithm that evaluates latency, bandwidth, and node load in real time is introduced that yields reduced latency and more consistent wait times relative to heuristic and genetic baselines.
Anshul Atre, K. Singh, Brijesh Kumar Chaurasia et al.· Journal of Circuits, Systems...· 0 citations
Findings confirm that system stability and service quality are bounded by fog density, QoS-aware routing, and real-time load regulation, rather than by mere resource scaling.
