Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs

  • Authors:
  • Juan Luís Laredo;Pedro Angel Castillo;Ben Paechter;Antonio Miguel Mora;Eva Alfaro-Cid;Anna I. Esparcia-Alcázar;Juan Julián Merelo

  • Affiliations:
  • Department of Architecture and Computer Technology, University of Granada. ETSIT., Periodista Daniel Saucedo Aranda s/n., 18071 Granada, Spain);Department of Architecture and Computer Technology, University of Granada. ETSIT., Periodista Daniel Saucedo Aranda s/n., 18071 Granada, Spain);Centre for Emergent Computing, School of Computing, Napier University,;Department of Architecture and Computer Technology, University of Granada. ETSIT., Periodista Daniel Saucedo Aranda s/n., 18071 Granada, Spain);Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Spain);Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Spain);Department of Architecture and Computer Technology, University of Granada. ETSIT., Periodista Daniel Saucedo Aranda s/n., 18071 Granada, Spain)

  • Venue:
  • Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.