Title: PSO optimised workflow scheduling and VM replacement algorithm using gaming concept in cloud data centre

Authors: Raman Narayani; Wahab Aisha Banu

Addresses: Department of Computer Science and Engineering, BSA Crescent Institute of Science and Technology, Chennai, Tamil Nadu, India ' Department of Computer Science and Engineering, BSA Crescent Institute of Science and Technology, Chennai, Tamil Nadu, India

Abstract: The principal features of cloud computing are dynamic resource allocation and its pricing nature. This paper implies an algorithm that provides resources based on the demand to users in the cloud infrastructure as a service (IaaS) environment. This paper proposes an algorithm that optimises workflow scheduling and VM replacement algorithm using particle swarm optimisation with the gaming theory concept (GTPSO-WSP). It enhances system performance with metrics such as cost and makespan. The proposed algorithm in the cloud computing environment has two phases. In the first phase, the scheduler allocates the resources to the physical server based on a static scheduling algorithm. During the second phase, the proposed system applies the dynamic reconfiguration based on the GTPSO-WSP algorithm for reducing the cost and makespan of the workflow. In GTPSO-WSP, the multi-start method gives a solution to particle premature convergence. However, the experimental analysis in the WorkflowSim environment improves the makespan and monitory cost. The observed results indicate performance improvement of 4% in terms of makespan and 9% in terms of cost while comparing GTPSO-WSP with the traditional particle swarm optimisation (PSO) and Cuckoo search algorithm.

Keywords: algorithm; cloud computing; game theory; makespan; optimisation; placement; physical server; resource allocation; scheduling; workflow.

DOI: 10.1504/IJCC.2023.134647

International Journal of Cloud Computing, 2023 Vol.12 No.6, pp.586 - 604

Received: 24 Apr 2020
Accepted: 06 Dec 2020

Published online: 03 Nov 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article