Validating a Peer-to-Peer Evolutionary Algorithm

This paper proposes a simple experiment for validating a Peer-to-Peer Evolutionary Algorithm in a real computing infrastructure in order to verify that results meet those obtained by simulations. The validation method consists of conducting a well-characterized experiment in a large computer cluster of up to a number of processors equal to the population estimated by the simulator. We argue that the validation stage is usually missing in the design of large-scale distributed meta-heuristics given the difficulty of harnessing a large number of computing resources. That way, most of the approaches in the literature focus on studying the model viability throughout a simulation-driven experimentation. However, simulations assume idealistic conditions that can influence the algorithmic performance and bias results when conducted in a real platform. Therefore, we aim at validating simulations by running a real version of the algorithm. Results show that the algorithmic performance is rather accurate to the predicted one whilst times-to-solutions can be drastically decreased when compared to the estimation of a sequential run.

[1]  Giorgio Valentini,et al.  Optimisation of the enhanced distance based broadcasting protocol for MANETs , 2011, The Journal of Supercomputing.

[2]  Alberto Montresor,et al.  Gossiping Differential Evolution: A Decentralized Heuristic for Function Optimization in P2P Networks , 2010, 2010 IEEE 16th International Conference on Parallel and Distributed Systems.

[3]  Juan Julián Merelo Guervós,et al.  EvAg: a scalable peer-to-peer evolutionary algorithm , 2010, Genetic Programming and Evolvable Machines.

[4]  Juan Julián Merelo Guervós,et al.  A Peer-to-Peer Approach to Genetic Programming , 2011, EuroGP.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Martin Suter,et al.  Small World , 2002 .

[7]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

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

[9]  Andrew Lewis,et al.  Asynchronous multiple objective particle swarm optimisation in unreliable distributed environments , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[10]  Klaus Wehrle,et al.  Peer-to-Peer Systems and Applications , 2005, Peer-to-Peer Systems and Applications.

[11]  Klaus Wehrle,et al.  What Is This "Peer-to-Peer" About? , 2005, Peer-to-Peer Systems and Applications.

[12]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[13]  A. E. Eiben,et al.  Peer-to-peer evolutionary algorithms with adaptive autonomous selection , 2007, GECCO '07.

[14]  Rohit Bhatia,et al.  Montecito: a dual-core, dual-thread Itanium processor , 2005, IEEE Micro.

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

[16]  Juan Julián Merelo Guervós,et al.  Exploring population structures for locally concurrent and massively parallel Evolutionary Algorithms , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[17]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[18]  Jian Cheng,et al.  A novel multi-population cultural algorithm adopting knowledge migration , 2011, Soft Comput..