Jul 2026· Malaysian Journal of Computer Science· Vol 38, pp. 335-353· 0 citations· 38 references
TL;DR
A Risk-Aware Task Scheduling Strategy (RATSS) that incorporates variability into the optimization process by minimizing the standard deviation of makespan and waiting time, thereby reducing execution uncertainty and demonstrating improved stability, fairness, and overall system performance.
Abstract
Efficient task scheduling in cloud-edge environments remains a significant challenge due to resource heterogeneity, varying workloads, and conflicting objectives of Cloud Service Providers (CSPs) and Cloud Service Users (CSUs). Existing multi-objective approaches primarily optimize average-based metrics such as makespan and waiting time while neglecting performance variability, leading to workload imbalance and unstable execution. To address this limitation, this study proposes a Risk-Aware Task Scheduling Strategy (RATSS) that incorporates variability into the optimization process by minimizing the standard deviation of makespan and waiting time, thereby reducing execution uncertainty. Reducing makespan variability improves workload consistency and resource utilization for CSPs, while minimizing waiting-time variability ensures fairness and reduced delays for CSUs. A composite metric, Satisfaction Ratio (SR), is introduced to jointly capture stability and fairness. The proposed approach is evaluated using the NASA iPSC workload dataset and compared with Non-dominated Sorting Genetic Algorithm (NSGA)-I, NSGA-II, Multi-Objective Particle Swarm Optimization, and the Strength Pareto Evolutionary Algorithm II. Results show average reductions of 48.05% and 63.23% in makespan and waiting-time variability, respectively, demonstrating improved stability, fairness, and overall system performance.
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 addres...
M. Yacoub, Ahmed E. Abdel Raouf, Walaa K. Gad et al.· Electronics· 0 citations
Energy-aware task scheduling in heterogeneous cloud infrastructures remains challenging due to the combinatorial growth of task-to-resource assignments, resource heterogeneity, and the need to balance energy consumption with scheduling performance. This paper proposes an Adaptive Dominance-Guided Grey Wolf Optimizer (A...
Saleh Al Shamaa, Wei Shi, J. Corriveau· IEEE International Conferenc...· 0 citations
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.
Youssef Oukissou, Hamza Elhaou, Driss Ait Omar et al.· 1 citation
TADOF is a dynamic optimization framework that jointly performs energy-aware elastic scaling and task migration under drift-aware periodic modeling and burst detection and observed about 18–34% lower energy and 15–28% lower migration cost than threshold and A2C/TD3 baselines while preserving QoS.
Juan Guo, Yanqun Zuo, Zhixian Chang· Cluster Computing· 0 citations
The experimental results demonstrate that DBS consistently outperforms state-of-the-art algorithms in terms of multiple performance metrics and confirm that the proposed scheduler effectively enhances deadline compliance, workload balance, scalability, and overall cloud system performance under heterogeneous and high-l...
Muhammad, Yasir Noman Khalid, Ahmad Alshamayleh et al.· Journal of Supercomputing· 0 citations
The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, res...
Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al.· Future Internet· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.