NDSU North Dakota State University
Fargo, N.D.
library-image

NDSU Institutional Repository

Parallelization of Generic PSO Java Code Using MPJExpress

Show simple item record

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.title Parallelization of Generic PSO Java Code Using MPJExpress en_US
dc.date.accessioned 2013-02-21T20:48:33Z
dc.date.available 2013-02-21T20:48:33Z
dc.date.issued 2013-02-21
dc.identifier.uri http://hdl.handle.net/10365/22571
dc.date 2013 en_US
dc.thesis.degree Master of Science. en_US
dc.contributor.advisor Ludwig, Simone
dc.subject.course Master of Science / Computer Science, College of Science and Mathematics, 2013. en_US

This item appears in the following Collection(s)

Show simple item record

Search DSpace



Advanced Search

Browse

Your Account