parallel particle swarm optimization
Recently Published Documents


TOTAL DOCUMENTS

132
(FIVE YEARS 18)

H-INDEX

19
(FIVE YEARS 2)

Information ◽  
2021 ◽  
Vol 12 (12) ◽  
pp. 530
Author(s):  
Congmin Yang ◽  
Tao Zhu ◽  
Yang Zhang ◽  
Huansheng Ning ◽  
Liming Chen ◽  
...  

The particle swarm optimization (PSO) algorithm has been widely used in various optimization problems. Although PSO has been successful in many fields, solving optimization problems in big data applications often requires processing of massive amounts of data, which cannot be handled by traditional PSO on a single machine. There have been several parallel PSO based on Spark, however they are almost proposed for solving numerical optimization problems, and few for big data optimization problems. In this paper, we propose a new Spark-based parallel PSO algorithm to predict the co-authorship of academic papers, which we formulate as an optimization problem from massive academic data. Experimental results show that the proposed parallel PSO can achieve good prediction accuracy.


Sensors ◽  
2021 ◽  
Vol 21 (18) ◽  
pp. 6212
Author(s):  
Xinying Chen ◽  
Siyi Xiao

An application based on a microservice architecture with a set of independent, fine-grained modular services is desirable, due to its low management cost, simple deployment, and high portability. This type of container technology has been widely used in cloud computing. Several methods have been applied to container-based microservice scheduling, but they come with significant disadvantages, such as high network transmission overhead, ineffective load balancing, and low service reliability. In order to overcome these disadvantages, in this study, we present a multi-objective optimization problem for container-based microservice scheduling. Our approach is based on the particle swarm optimization algorithm, combined parallel computing, and Pareto-optimal theory. The particle swarm optimization algorithm has fast convergence speed, fewer parameters, and many other advantages. First, we detail the various resources of the physical nodes, cluster, local load balancing, failure rate, and other aspects. Then, we discuss our improvement with respect to the relevant parameters. Second, we create a multi-objective optimization model and use a multi-objective optimization parallel particle swarm optimization algorithm for container-based microservice scheduling (MOPPSO-CMS). This algorithm is based on user needs and can effectively balance the performance of the cluster. After comparative experiments, we found that the algorithm can achieve good results, in terms of load balancing, network transmission overhead, and optimization speed.


Author(s):  
Bin Cao ◽  
Yu Gu ◽  
Zhihan Lv ◽  
Shan Yang ◽  
Jianwei Zhao ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document