Resource scheduling in cloud environment using particle swarm search algorithm Online publication date: Tue, 20-Aug-2024
by Malay Kumar Majhi; Manas Ranjan Kabat; Satya Prakash Sahoo
International Journal of Cloud Computing (IJCC), Vol. 13, No. 4, 2024
Abstract: Cloud computing has gained significant popularity as a platform for processing large-scale data analytics, offering benefits such as high availability, robustness, and cost-effectiveness. However, job scheduling in cloud systems presents a major challenge, as it directly impacts execution time and operational costs. To address these issues, this paper presents a novel multi-adaptive convergent particle swarm optimisation (MAC-PSO) algorithm designed to decrease the failure rate, minimise makespan values, and enhance resource utilisation. The round Robin scheduling method aids in task execution by determining the appropriate time-space allocation. The proposed algorithm's performance is compared to that of the TLBO algorithm, demonstrating that MAC-PSO outperforms both TLBO and the original PSO. Moreover, a comprehensive analysis is proposed to evaluate the performance metrics within the MAC-PSO algorithm. Notably, MAC-PSO effectively increases the ratio of solutions that dominate previous algorithmic approaches and identifies a greater number of solutions that cater to user preferences.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Cloud Computing (IJCC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com