Research Output
Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs
  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.

  • Date:

    31 December 2007

  • Publication Status:

    Published

  • Funders:

    Historic Funder (pre-Worktribe)

Citation

Laredo, J. L. J., Castillo, P. A., Paechter, B., Mora, A. M., Alfaro-Cid, E., Esparcia-Alcazar, A. I., & Merelo, J. J. (2007). Empirical Validation of a Gossiping Communication Mechanism for Parallel EAs. In Applications of Evolutionary Computing: EvoWorkshops 2007. , (129-136)

Authors

Keywords

Evolutionary Algorithm, Knapsack Problem, Communication Overhead, Overlay Network, Empirical Validation

Monthly Views:

Available Documents