Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackley, D.H.: A connectionist machine for genetic hillclimbing. Kluwer Academic Publishers, Norwell (1987)
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)
Biazzini, M., Montresor, A.: Gossiping de: A decentralized heuristic for function optimization in p2p networks. In: ICPADS 2010, pp. 468–475 (2010)
Eibenand, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)
Guo, Y., Cheng, J., Cao, Y., Lin, Y.: A novel multi-population cultural algorithm adopting knowledge migration. Soft Comput. 15(5), 897–905 (2011)
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)
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)
Laredo, J.L.J., Eiben, A.E., van Steen, M., Julián Merelo Guervós, J.: Evag: a scalable peer-to-peer evolutionary algorithm. Genetic Programming and Evolvable Machines 11(2), 227–246 (2010)
Laredo, J.L.J., Lombraña, D., de Vega, F.F., Arenas, M.G., Merelo, J.J.: A Peer-to-Peer Approach to Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 108–117. Springer, Heidelberg (2011)
McNairy, C., Bhatia, R.: Montecito: a dual-core, dual-thread itanium processor. IEEE Micro. 25(2), 10–20 (2005)
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
Sastry, K.: Evaluation-relaxation schemes for genetic and evolutionary algorithms. Technical Report 2002004, University of Illinois at Urbana-Champaign, Urbana, IL (2001)
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)
Steinmetz, R., Wehrle, K.: What is this Peer-to-Peer About? In: Steinmetz, R., Wehrle, K. (eds.) Peer-to-Peer Systems and Applications. LNCS, vol. 3485, pp. 9–16. Springer, Heidelberg (2005)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ”small-world” networks. Nature 393, 440–442 (1998)
Wickramasinghe, W.R.M.U.K., van Steen, M., Eiben, A.E.: Peer-to-peer evolutionary algorithms with adaptive autonomous selection. In: GECCO 2007, pp. 1460–1467. ACM Press, New York (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laredo, J.L.J., Bouvry, P., Mostaghim, S., Merelo-Guervós, JJ. (2012). Validating a Peer-to-Peer Evolutionary Algorithm. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2012. Lecture Notes in Computer Science, vol 7248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29178-4_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-29178-4_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29177-7
Online ISBN: 978-3-642-29178-4
eBook Packages: Computer ScienceComputer Science (R0)