A discrete PSO-based static load balancing algorithm for distributed simulations in a cloud environment

• DOI: 10.1016/j.future.2020.09.016
• Publication Date: 2020-09-29T23:34:32Z
• Authors: Zhang Miao; Peng Yong; Yang Mei; Yin Quanjun; Xie Xu
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

Abstract It is vital to balance the computation and communication load for the satisfactory performance of large-scale parallel and distributed simulations deployed on shared resources in a cloud computing environment. The suitable allocation of simulation components (federates) to hosts is essentially a discrete optimisation problem and the particle swarm optimisation (PSO) algorithm is considered to be highly adequate for this purpose. However, the bionic approach was initially designed for continuous optimisation problems and many PSO-based load balancing algorithms suffered due to the random movement of particles owing to their improper discretisation strategies. Moreover, the method adopted by PSO and most of its variants to update the personal best positions considered only the experience of the particles, which resulted in a bad particle being chosen as the leader. In this study, we propose a new PSO-based static load balancing algorithm named adaptive P b e s t discrete PSO (APDPSO) to counter these issues. Good solutions stored in the external archive are utilised when updating the personal best positions of the particles and a probability- and similarity-based discretisation method for PSO is proposed to update the velocity and position vectors of the particles. Simulation experiments injecting random synthetic tasks are conducted on MATLAB and CloudSim platforms. The results showed that our proposed algorithm improved the convergence and diversity of the swarm significantly and reduced the degree of imbalance of loads efficiently, as compared to the state of the art in this area.