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.
KeywordsEvolutionary Algorithm Parallel Version Large Problem Instance Medium Size Instance Homogeneous Node
Unable to display preview. Download preview PDF.
- 2.Anderson, D.P.: Boinc: A system for public-resource computing and storage. In: 5th IEEE/ACM International Workshop on Grid Computing, pp. 4–10 (2004)Google Scholar
- 3.Biazzini, M., Montresor, A.: Gossiping de: A decentralized heuristic for function optimization in p2p networks. In: ICPADS 2010, pp. 468–475 (2010)Google Scholar
- 4.Eibenand, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)Google Scholar
- 6.Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (October 2002)Google Scholar
- 7.Laredo, J.L.J., Castillo, P.A., Mora, A.M., Merelo, J.J.: Exploring population structures for locally concurrent and massively parallel evolutionary algorithms. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC2008), WCCI 2008, pp. 2610–2617. IEEE Press, Hong Kong (2008)Google Scholar
- 11.Ruiz, P., Dorronsoro, B., Valentini, G., Pinel, F., Bouvry, P.: Optimisation of the enhanced distance based broadcasting protocol for manets. J. of Supercomputing. Special Issue on Green Networks, 1–28 (February 23, 2011), Online FirstTM Google Scholar
- 12.Sastry, K.: Evaluation-relaxation schemes for genetic and evolutionary algorithms. Technical Report 2002004, University of Illinois at Urbana-Champaign, Urbana, IL (2001)Google Scholar
- 13.Scriven, I., Ireland, D., Lewis, A., Mostaghim, S., Branke, J.: Asynchronous multiple objective particle swarm optimisation in unreliable distributed environments. In: IEEE Congress on Evolutionary Computation, CEC 2008 (2008)Google Scholar