Towards a decentralized architecture for optimization

We introduce a generic framework for the distributed execution of combinatorial optimization tasks. Instead of relying on custom hardware (like dedicated parallel machines or clusters), our approach exploits, in a peer-to-peer fashion, the computing and storage power of existing, off-theshelf desktops and servers. Contributions of this paper are a description of the generic framework, together with a first instantiation based on particle swarm optimization (PSO). Simulation results are shown, proving the efficacy of our distributed PSO algorithm in optimizing a large number of benchmark functions.

• Type: Conference
• Year: 2008
• Where: IPPS
• Authors: Marco Biazzini, Mauro Brunato, Alberto Montresor
• Keywords: Combinatorial Optimization Tasks, Dedicated Parallel Machines, Distributed And Parallel Computing, Generic Framework, IPPS 2008