Back to search

North Dakota State University

Parallelization of Generic PSO Java Code Using MPJExpress

Abstract

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.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Madamanchi, Manoj Babu

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/22571

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Madamanchi, Manoj Babu. Parallelization of Generic PSO Java Code Using MPJExpress. North Dakota State University, 2013. https://hdl.handle.net/10365/22571