Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs

Laredo, J. L. J.; Castillo, P. A.; Paechter, B.; Mora, A. M.; Alfaro-Cid, E.; Esparcia-Alcazar, A. I.; Merelo, J. J.

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.

Citation

Laredo, J. L. J., Castillo, P. A., Paechter, B., Mora, A. M., Alfaro-Cid, E., Esparcia-Alcazar, A. I., & Merelo, J. J. (2007, December). Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs. Presented at EvoWorkshops: Workshops on Applications of Evolutionary Computation

• Presentation Conference Type: Conference Paper (published)
• Conference Name: EvoWorkshops: Workshops on Applications of Evolutionary Computation
• Publication Date: 2007
• Deposit Date: Aug 26, 2020
• Publisher: Springer
• Pages: 129-136
• Series Title: Lecture Notes in Computer Science
• Series Number: 4448
• Series ISSN: 1611-3349
• Book Title: Applications of Evolutionary Computing: EvoWorkshops 2007
• ISBN: 978-3-540-71804-8
• Keywords: Evolutionary Algorithm, Knapsack Problem, Communication Overhead, Overlay Network, Empirical Validation
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2678