Abstract
Gossiping is a self-organized and decentralized approach to distribute algorithms through Peer-to-Peer (P2P) networks. Based on such an approach, the Evolvable Agent model is a P2P Evolutionary Algorithm (EA) whose population structure is defined by the gossiping protocol newscast, a protocol that behaves asymptotically as a small-world graph. This paper explores the impact of different cache sizes on the algorithm performance given that cache size is the only tunable parameter in newscast. To this aim, the problem generator wP-PEAKS and the multimodal deceptive problem MMDP have been used as benchmarks. Results show that the quality of the solutions and the run-time of the algorithm are not altered when changing the settings of the cache size. This fact points out that newscast is a robust gossiping protocol for tackling distributed evolutionary computation.
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
Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evolutionary Computation 6(5), 443–462 (2002)
Alfaro-Cid, E., Castillo, P.A., Esparcia-Alcázar, A., Sharman, K., Merelo, J.J., Prieto, A., Mora, A.M., Laredo, J.L.J.: Comparing multiobjective evolutionary ensembles for minimizing type i and ii errors for bankruptcy prediction. In: IEEE Congress on Evolutionary Computation, pp. 2902–2908. IEEE, Los Alamitos (2008)
Cantú-Paz, E.: Topologies, migration rates, and multi-population parallel genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 91–98. Morgan Kaufmann, Orlando (1999)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)
García-Sánchez, P., Merelo, J.J., Laredo, J.L.J., Mora, A., Castillo, P.A.: Evolving xslt stylesheets for document transformation. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 1021–1030. Springer, Heidelberg (2008)
Giacobini, M., Preuß, M., Tomassini, M., et al.: Effects of scale-free and small-world topologies on binary coded self-adaptive CEA. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 86–98. Springer, Heidelberg (2006)
Goldberg, D.E., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2. Elsevier Science Publishers, B. V., Amsterdam (1992), http://citeseer.ist.psu.edu/133799.html
Hidalgo, I., Fernández, F.: Balancing the computation effort in genetic algorithms. In: The 2005 IEEE Congress on Evolutionary Computation, 2005, vol. 2, pp. 1645–1652. IEEE Press, Los Alamitos (2005)
Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet. Tech. Rep. IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (2002), http://www.cs.vu.nl/pub/papers/globe/IR-503.02.pdf
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)
Jong, K.A.D., Potter, M.A., Spears, W.M.: Using problem generators to explore the effects of epistasis. In: Bäck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA 1997). Morgan Kaufmann, San Francisco (1997), citeseer.ist.psu.edu/dejong97using.html
Laredo, J.L.J., Castillo, P.A., Mora, A., Merelo, J.J.: Exploring population structures for locally concurrent and massively parallel evolutionary algorithms. In: IEEE Congress on Evolutionary Computation (CEC2008), WCCI2008 Proceedings, pp. 2610–2617. IEEE Press, Hong Kong (2008)
Odeh, S.M., Ros, E., Rojas, I., Palomares, J.M.: Skin lesion diagnosis using fluorescence images. In: Campilho, A., Kamel, M.S. (eds.) ICIAR 2006. LNCS, vol. 4142, pp. 648–659. Springer, Heidelberg (2006)
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)
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. LNCS (LNAI), vol. 2872, pp. 47–58. Springer, Heidelberg (2004)
Watts, D., Strogatz, S.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998), http://dx.doi.org/10.1038/30918
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laredo, J.L.J., Fernandes, C., Mora, A., Castillo, P.A., García-Sánchez, P., Merelo, J.J. (2009). Studying the Cache Size in a Gossip-Based Evolutionary Algorithm. In: Papadopoulos, G.A., Badica, C. (eds) Intelligent Distributed Computing III. Studies in Computational Intelligence, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03214-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-03214-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03213-4
Online ISBN: 978-3-642-03214-1
eBook Packages: EngineeringEngineering (R0)