No abstract

No abstract

No abstract

No abstract

In this paper, on the basis of the method particle swarm optimization was developed the algorithm of the parallel search of global extremum. In the system of parallel programming on C language implemented method of particle swarm for the global minimization of functions. The performance of the parallel method was tested for two famous benchmark optimization problems (Styblinski Tang function and Rastrigin function) and compared with the results obtained by employing the sequential method. Conducted research on the effectiveness of parallelization has shown the advantage of the parallel algorithm.