Show simple item record

dc.contributor.authorGhosh, Priyanka Singh
dc.description.abstractParticle Swarm Optimization (PSO) has received attention in many research fields and real-world applications for solving optimization problems in the areas of intelligent transportation systems, wireless sensor networks, finance, and engineering. Factor that affects the performance of PSO is its ability of the exploration in a multi-dimensional search space, which can increase the execution time quite significantly. The parallel implementation of PSO is a way to address this. In this paper, we implement and compare the parallel implementation of PSO using two different parallelization techniques using MapReduce programming, 1) all nodes in the cluster work on the same population, and 2) each node in cluster has its own population. Both of the parallel implementations are compared based on performance and speedup. Parallel implementation of the PSO algorithm makes the algorithm faster and scalable in order to find best solutions while working with large datasets in high dimensional search spaces.en_US
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU Policy 190.6.2
dc.titleParallelization of Particle Swarm Optimization Algorithm Using Hadoop Mapreduceen_US
dc.typeMaster's paperen_US
dc.date.accessioned2016-04-05T13:51:33Z
dc.date.available2016-04-05T13:51:33Z
dc.date.issued2016
dc.identifier.urihttp://hdl.handle.net/10365/25566
dc.subject.lcshApache Hadoop.en_US
dc.subject.lcshBig data.en_US
dc.subject.lcshParallel processing (Electronic computers)en_US
dc.subject.lcshMathematical optimization.en_US
dc.subject.lcshSwarm intelligence.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdf
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeEngineeringen_US
ndsu.departmentComputer Scienceen_US
ndsu.programComputer Scienceen_US
ndsu.advisorLudwig, Simone


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record