The experimental results show that the proposed Enhanced Ant Colony Optimization with the Swap-Based Local Search and Elitist Strategy approaches outperforms FCFS, ACO, and ACO with Local Search for both normal and heavy scenarios and demonstrates that the integration of local search and elitist strategy effectively improves the convergence process toward the global optimal solution while promoting a fairer utilization of resources.
Abstract
Cloud computing allows the execution of various types of jobs with diverse resource requirements, so an efficient scheduling mechanism is needed to minimize processing time and improve resource utilization. The Ant Colony Optimization (ACO) algorithm is one of the metaheuristic methods widely used for job scheduling optimization. However, the ACO algorithm still has limitations in slow convergence and a tendency to get stuck in local solutions. This study proposes Enhanced Ant Colony Optimization with the Swap-Based Local Search and Elitist Strategy approaches to improve the quality of scheduling decisions. Evaluations were conducted in a heterogeneous emulated cloud environment with a focus on scheduling performance, convergence behaviour, and resource utilization metrics. The experimental results show that the proposed method outperforms FCFS, ACO, and ACO with Local Search for both normal and heavy scenarios. The study also demonstrates that the integration of local search and elitist strategy effectively improves the convergence process toward the global optimal solution while promoting a fairer utilization of resources. This paper may serve as a basis for further development on larger job scales and the addition of other optimization techniques.
This paper proposes a new algorithm named Opposition-Based Firebug Tunicate Optimization (OFTO), which is specifically designed to optimize key Quality of Service parameters by minimizing execution cost, reducing makespan, and accelerating convergence making the proposed algorithm a Deadline Sensitive Task Scheduler (D...
Chirag Chandrashekar, Pradeep Krishnadoss, A. Sivaraman et al.· Cluster Computing· 0 citations
Efficient resource scheduling is essential for reducing service latency and improving resource utilization in cloud data centers. This study develops an improved genetic-simulated annealing hybrid algorithm (GASA) for task-to-virtual-machine allocation under heterogeneous workload conditions. A task-resource scheduling...
Yu-Xin Wang, Xiu-Kun Wang, Xiao-Fang Zheng· The International Conference...· 0 citations
Cloud computing (CC) has grown as a core component of modern computing facilities, providing users with adaptable, on-demand services. In dynamic environments, the effective utilization of resources is significant for performance, cost-effectiveness, and user satisfaction. The optimization of resource allocation is imp...
V. Mahalakshmi, S. Poornima· International Journal of Adv...· 0 citations
Cloud computing has become the primary method for providing on-demand computing services, and provides both flexibility and scalability for many types of applications. The efficiency of cloud environments, however, depends heavily upon the effectiveness of the scheduling of tasks, which is a known NP-complete problem....
Nora Omran Alkaam· International journal of res...· 0 citations
Task scheduling in cloud computing is an NP-hard multi-objective problem that requires the simultaneous optimization of makespan, execution cost, and energy consumption. Although individual metaheuristic algorithms can be strong optimizers, they often fail to achieve a reasonable exploration/exploitation balance across...
Batool Hamid· Al-Noor Journal of Engineeri...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.