Self-adaptive Gossip Policies for Distributed Population-based Algorithms

Gossipping has demonstrate to be an efficient mechanism for spreading information among P2P networks. Within the context of P2P computing, we propose the so-called Evolvable Agent Model for distributed population-based algorithms which uses gossipping as communication policy, and represents every individual as a self-scheduled single thread. The model avoids obsolete nodes in the population by defining a self-adaptive refresh rate which depends on the latency and bandwidth of the network. Such a mechanism balances the migration rate to the congestion of the links pursuing global population coherence. We perform an experimental evaluation of this model on a real parallel system and observe how solution quality and algorithm speed scale with the number of processors with this seamless approach.

[1]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[2]  Johan Berntsson,et al.  G2DGA: an adaptive framework for internet-based distributed genetic algorithms , 2005, GECCO '05.

[3]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[4]  Marco Tomassini,et al.  Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series) , 2005 .

[5]  Donal O'Mahony,et al.  Overlay Networks: A Scalable Alternative for P2P , 2003, IEEE Internet Comput..

[6]  H. Penny Nii,et al.  Blackboard Systems, Part One: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures , 1986, AI Mag..

[7]  Erick Cantú-Paz,et al.  Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[8]  J.-P. Vacher,et al.  Genetic algorithms in a multi-agent system , 1998, Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174).

[9]  Anthony A. Maciejewski,et al.  A comparative study of five parallel genetic algorithms using the traveling salesman problem , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[10]  Márk Jelasity,et al.  Large-Scale Newscast Computing on the Internet , 2002 .

[11]  H. Penny Nii,et al.  Blackboard systems: the blackboard model of problem solving and the evolution of blackboard architectures , 1995 .

[12]  José Ignacio Hidalgo,et al.  Balancing the computation effort in genetic algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[13]  Ben Paechter,et al.  A Framework for Distributed Evolutionary Algorithms , 2002, PPSN.

[14]  Elena Marchiori,et al.  Evolutionary Algorithms with On-the-Fly Population Size Adjustment , 2004, PPSN.

[15]  Erick Cantú-Paz,et al.  Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms , 1999, GECCO.

[16]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.