ComputingComputer EngineeringComputer ScienceOptimizationParallel AlgorithmsParallel ComputingData ParallelismFault-tolerant Parallel AlgorithmsParallel Algorithm DesignParallel ArchitecturesParallel ComputationParallel Computing SystemsMapreduceMapreduce AlgorithmsNode FailuresParallel OptimizationParallel Performance OptimizationParallelizationParticle Swarm Optimization
In optimization problems involving large amounts of data, Particle Swarm Optimization (PSO) must be parallelized because individual function evaluations may take minutes or even hours. However, large-scale parallelization is difficult because programs must communicate efficiently, balance workloads and tolerate node failures. To address these issues, we present Map Reduce Particle Swarm Optimization(MRPSO), a PSO implementation based on Google's Map Reduce parallel programming model.
3
James Kennedy, R.C. Eberhart · 2002 · 47.5K citations
Riccardo Poli, James Kennedy, Tim Blackwell · Swarm Intelligence · 2007 · 21.4K citations
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text