| dc.contributor.author | Madamanchi, Manoj Babu | |
| dc.description.abstract | Many scientific, engineering and economic problems involve the optimization of a set of parameters. The Particle Swarm Optimization (PSO) is one of the new techniques that have been empirically shown to perform well. The PSO algorithm is a population-based search algorithm based on simulating the social behavior of birds within a flock. Large-scale engineering optimization problems impose large computational demands, resulting in long solution times even on modern high-end processors. To obtain enhanced computational throughput and global search capability parallel algorithms and parallel architectures have drawn lots of attention. Parallelization of PSO has proved to enhance computational throughput and global search capability
In this paper, we detail the parallelization of an increasingly popular global search method, the PSO algorithm using MPJ Express. Both synchronous and asynchronous parallel implementations are investigated. The parallel PSO algorithm’s robustness and efficiency are demonstrated by using four standard benchmark functions Alpine, Rosenbrock, Rastrigin and Schaffer. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Parallelization of Generic PSO Java Code Using MPJExpress | en_US |
| dc.type | Master's paper | en_US |
| dc.date.accessioned | 2013-02-21T20:48:33Z | |
| dc.date.available | 2013-02-21T20:48:33Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | http://hdl.handle.net/10365/22571 | |
| dc.subject.lcsh | Mathematical optimization. | en_US |
| dc.subject.lcsh | Parallel algorithms. | en_US |
| dc.subject.lcsh | Swarm intelligence. | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Ludwig, Simone | |
