Empirical validation of a gossiping communication mechanism for parallel EAs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4448 LNCS, Issue , 2007, Pages 129-136

  Laredo, J L J ^a   Castillo, P A ^a   Paechter, B ^b   Mora, A M ^a   Alfaro Cid, E ^c   Esparcia Alcazar A I ^c   Merelo, J J ^a  

^a UNIVERSITY OF GRANADA   (Spain)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

^c INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

DISTRIBUTED RESOURCE MACHINE (DRM); PEER-TO-PEER (P2P) SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548099012     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71805-5_14     Document Type: Conference Paper

References (15)

1. M. G. Arenas, B. Dolin, Juan-Julián Merelo-Guervós, P. A. Castillo, I. Fernández de Viana, and M. Schoenauer. JEO: Java Evolving Objects. In W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska., editors, Poster Accepted at GECCO 2002, page 991, 2002. Available from http://geneura.ugr.es/pub/papers/MPP104.ps.gz http://citeseer.nj.nec.eom/ context/2198210/0.
2. M.G. Arenas, Pierre Collet, A.E. Eiben, Mark Jelasity, J. J. Merelo, Ben Paechter, Mike Preuß, and Marc Schoenauer. A framework for distributed evolutionary algorithms. Number 2439 in Lecture Notes in Computer Science,LNCS. Springer-Verlag, September 2002. Available from http://www.amazon.com/exec/ obidos/ASIN/3540441395/perltutobyjjmere and http://www.springeronline.com/sgw/ cda/frontpage/0,10735,5-40109-22-224086-0,00.html.
3. Victor Martín Molina; Juan Julián Merelo Guervós; Juan Luis Jiménez Laredo; Maribel García Arenas. Algoritmos evolutivos en Java: resolución del TSP usando DREAM. In Actas XVI Jornadas de Paralelismo, incluido en CEDI'2005. Granada, septiembre 2005, pages 667-683. Thomson, Septiembre 2005.
4. E. Cantú-Paz. Topologies, migration rates, and multi-population parallel genetic algorithms. In GECCO-99, Genetic and Evolutionary Computation Conference, pages 13-17, 1999.
5. Eva Alfaro Cid. Aumento de velocidad de convergencia usando un sistema distribuido (dream). Technical report, ITI, November 2004.
6. Diego Doval and Donal O'Mahony. Overlay networks: A scalable alternative for P2P. IEEE Internet Computing, pages 79-82, July 2003.
7. DREAM. Distributed resource evolutionary algorithms machine. http://dr-earn.sourceforge.net, 2001-2003. accessed on January 2007.
8. M. Jelasity, M. Preuss, and B. Paechter. A scalable and robust framework for distributed applications. In CEC 2002, IEEE Press, pages 1540-1545, 2002.
9. Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst., 23(3):219-252, 2005.
10. Márk Jelasity and Maarten van Steen. Large-scale newscast computing on the Internet, October 2002.
11. Zbigniew Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. ©Springer, 3 edition, November 1998.
12. Ralf Steinmetz and Klaus Wehrle, editors. Peer-to-Peer Systems and Applications, volume 3485 of Lecture Notes in Computer Science. Springer, 2005.
13. Ralf Steinmetz and Klaus Wehrle. What is this "peer-to-peer" about? In Peer-to-Peer Systems and Applications [12], pages 9-16.
14. Spyros Voulgaris, Mark Jelasity, and Maarten van Steen. A robust and scalable Peer-to-Peer Gossiping protocol. In Gianluca Moro, Claudio Sartori, and Munindar P. Singh, editors, AP2PC, volume 2872 of Lecture Notes in Computer Science, pages 47-58. Springer, 2003.
15. H. Zhang, A. Goel, and R. Govindan. Using the small-world model to improve Freenet performance. volume 3 of Proceedings IEEE INFOCOM 2002, pages 1228-1237. IEEE Infocom, 2002.