Levy Flight Osprey Optimization Algorithm for Task Scheduling in Cloud Computing
Task scheduling in a Cloud Computing (CC) environment offers flexible and scalable computing resources that encounter critical challenges that significantly affect the system performance. The existing methods often suffer from minimal convergence rates due to ineffective task scheduling, leading to a degradation in the quality of task scheduling in the CC environment. This paper proposes the Levy Flight Osprey Optimization Algorithm (LFOOA) for task scheduling, which provides high-quality scheduling solutions due to its effective search mechanisms. The novel approach aims to improve the convergence rate and reduce the time required for evaluation. The significance of task scheduling in CC lies in its responsibility for assigning tasks to each virtual machine, optimising execution time, and minimizing energy consumption. The existing methods namely, Particle Swarm Optimization (PSO), Random Double Adaptive Whale Optimization Algorithm (RDWOA) and Whale Optimization Algorithm (WOA) and PS-Grey Wolf Optimization (PSGWO) are evaluated in the proposed method. The LDOOA approach achieves better performance with a makespan of 97, resource utilization of 99%, and energy consumption of 1.1.
Authors
- Thomas Sure (ORCID: https://orcid.org/0009-0005-8385-7492)
- Rajesh Kumar (ORCID: https://orcid.org/0000-0002-6019-0702)
- Pradeep Chintale
- Gopi Desaboyina
- Narendra Babu Merla
- Pavana Prasanthi Goli Chinna
Institutions
- Enterprise Community Partners (US)
- T-Mobile (United States) (US)
- ServiceNow (United States) (US)
Publication Details
- Published
- 2024-08-23
- DOI
- https://doi.org/10.1109/iacis61494.2024.10721633
- Citations
- 6
- Primary Topic
- Air Traffic Management and Optimization
- Type
- article
- Field-Weighted Citation Impact
- 7.79