Affiliations: [a] School of Computing, DIT University, Dehradun India | [b] Department of Computer Science & Engineering, Amity University Jharkhand, India | [c] Vlenzor Technologies Pvt. Ltd. Calcutta, India
Correspondence:
[*]
Corresponding author: Soumen Kanrar, Department of Computer Science & Engineering, Amity University Jharkhand, India. E-mails: dr.soumen.kanrar@gmail.com; mrsoumenkanrar@gmail.com.
Abstract: A distributed system with a shared resource pool offers cloud computing services. According to the provider’s policy, customers can enjoy continuous access to these resources. Every time a job is transferred to the cloud to be carried out, the environment must be appropriately planned. A sufficient number of virtual machines (VM) must be accessible on the backend to do this. As a result, the scheduling method determines how well the system functions. An intelligent scheduling algorithm distributes the jobs among all VMs to balance the overall workload. This problem falls into the category of NP-Hard problems and is regarded as a load balancing problem. With spider monkey optimization, we have implemented a fresh strategy for more dependable and efficient load balancing in cloud environments. The suggested optimization strategy aims to boost performance by choosing the least-loaded VM to distribute the workloads. The simulation results clearly show that the proposed algorithm performs better regarding load balancing, reaction time, make span and resource utilization. The experimental results outperform the available approaches.
