@article {10.3844/jcssp.2024.1681.1695,
article_type = {journal},
title = {Efficient Resource Allocation and Task Scheduling in a Cloud Computing Environment using Swarm Intelligence},
author = {Rao, Panuganti Hanumantha and Subramanian, Rajakumar and Soman, Geetha},
volume = {20},
number = {12},
year = {2024},
month = {Nov},
pages = {1681-1695},
doi = {10.3844/jcssp.2024.1681.1695},
url = {https://thescipub.com/abstract/jcssp.2024.1681.1695},
abstract = {The new age of network-based computing, known as "cloud computing," is characterized by the distribution and sharing of resources over a network. These resources are available to anyone through the Internet on a pay-per-use basis. Any service that anybody uses can generate massive amounts of data. Therefore, in this scenario, there will be a significant cost associated with transferring data between two dependent resources. Furthermore, if not planned optimally, the overall cost of executing a complicated program could rise due to the application's high number of tasks. An effective allocation method is required to satisfy the ever-increasing demands for resources. Cloud computing has been the focus of extensive research. Present methods aim aiming dynamic resource allocation but are not cost-effective. In light of these issues, this article proposes a heuristic scheduling technique “Enhanced Cat Swarm Optimization” ECSO method to distribute application tasks among available resources, based on Cat Swarm Optimisation (CSO). The foraging nature of cats has served as inspiration for several resource allocations, one of which is Cat Swarm Optimisation (CSO). The proposed novel approach ECSO offers a modification to CSO that adds a crossover mechanism (Uniform crossover) to minimize the total execution cost. To find the optimal solution, the proposed ECSO method takes into account the cost of data transmission between dependent resources as well as the cost of job execution on different resources. The ECSO method is tested with a made-up workflow and evaluates how well it performs in comparison to the state-of-the-art CSO, PSO, and BCO algorithms for scheduling tasks. The experimental findings demonstrate that the proposed ECSO provides a total cost-minimizing task to resources. The ECSO outperformed existing CSOs, PSOs, and BCOs concerning total execution time of 8% lower and execution cost of 4% less. It also guarantees that the available resources are fairly distributed.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}