Abstract
The development of Peer-to-Peer (P2P) systems is still a challenge due to the huge number of factors involved. Validation of these systems must be defined in terms of describing the adequacy of the P2P model to the actual environment. This paper focuses on the validation of the Distributed Resource Machine (DRM) as a computational P2P system when applied to Evolutionary Algorithms (EAs ) using exclusively gossip-based mechanisms for communication. The adequacy will be measured by the range in which performance speedup actually takes place. Validation has been carried out by running an empirical performance study based on benchmarking techniques. It shows that it scales only up to a limited and small number of nodes, which is problem-dependent. Furthermore, due to the reason found for this lack of scalability, it seems unlikely that massive scalability takes place.
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
Arenas, M.G., Dolin, B., Merelo-Guervós, J.-J., Castillo, P.A., de Viana, I.F., Schoenauer, M.: JEO: Java Evolving Objects. In: Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N.:(eds.) Poster Accepted at GECCO 2002, p. 991 (2002) Available from http://geneura.ugr.es/pub/papers/MPP104.ps.gz http://citeseer.nj.nec.com/context/2198210/0
Arenas, M.G., Collet, P., Eiben, A.E., Jelasity, M., Merelo, J.J., Paechter, B., Preuß, M., Schoenauer, M.: A framework for distributed evolutionary algorithms. (http://www.amazon.com/exec/obidos/ASIN/3540441395/perltutobyjjmere,http://www.springeronline.com/sgw/cda/frontpage/0,10735,5-40109-22-2240 086-0,00.html,http://www.springeronline.com/sgw/cda/frontpage/0,10735,5-40109-22-224,http://www.springeronline.com/sgw/cda/frontpage/0,10735,5-40109-22-2240 0086-0,00.html086-0,00.html). LNCS, vol. 2439, pp. 5–419. Springer-Verlag, Berlin Heidelberg, New York (2002)
Molina, V.M., Guervós, J.J.M., Laredo, J.L.J., Arenas, M.G.: Algoritmos evolutivos en Java: resolución del TSP usando DREAM. In: Actas XVI Jornadas de Paralelismo, incluido en CEDI’2005. Granada, septiembre 2005, pp. 667–683. Thomson (Septiembre 2005)
Cantú-Paz, E.: Topologies, migration rates, and multi-population parallel genetic algorithms. In: GECCO-99, Genetic and Evolutionary Computation Conference, pp. 13–17 (1999)
Cid, E.A.: Aumento de velocidad de convergencia usando un sistema distribuido (dream). Technical report, ITI (November 2004)
Doval, D., O’Mahony, D.: Overlay networks: A scalable alternative for P2P. IEEE Internet Computing, pp. 79–82 (July 2003)
DREAM. Distributed resource evolutionary algorithms machine http://dr-ea-m.sourceforge.net, 2001–2003 (accessed on January 2007)
Jelasity, M., Preuss, M., Paechter, B.: A scalable and robust framework for distributed applications. In: CEC, pp. 1540–1545. IEEE Press, NJ, New York (2002)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)
Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet (October 2002)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. ©Springer, Berlin Heidelberg, New York (1998)
Steinmetz, R., Wehrle, K. (eds.): Peer-to-Peer Systems and Applications. LNCS, vol. 3485. Springer, Berlin Heidelberg New York (2005)
Steinmetz, R., Wehrle, K.: What is this ”peer-to-peer” about? In: Peer-to-Peer Systems and Applications [12], pp. 9–16
Voulgaris, S., Jelasity, M., van Steen, M.: A robust and scalable Peer-to-Peer Gossiping protocol. In: Moro, G., Sartori, C., Singh, M.P. (eds.) AP2PC 2003. LNAI (LNCS), vol. 2872, pp. 47–58. Springer, Berlin Heidelberg New York (2004)
Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve Freenet performance. vol. 3 In: Proceedings IEEE INFOCOM 2002, pp. 1228–1237. IEEE Infocom (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laredo, J.L.J. et al. (2007). Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs. In: Giacobini, M. (eds) Applications of Evolutionary Computing. EvoWorkshops 2007. Lecture Notes in Computer Science, vol 4448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71805-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-71805-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71804-8
Online ISBN: 978-3-540-71805-5
eBook Packages: Computer ScienceComputer Science (R0)