Validating a peer-to-peer evolutionary algorithm

Authors:
Juan Luis Jiménez Laredo;Pascal Bouvry;Sanaz Mostaghim;Juan-Julián Merelo-Guervós
Affiliations:
Faculty of Sciences, Technology and Communication, University of Luxembourg, Luxembourg City, Luxembourg;Faculty of Sciences, Technology and Communication, University of Luxembourg, Luxembourg City, Luxembourg;Karlsruhe Institute of Technologie, Karlsruhe, Germany;ATC-ETSIIT, University of Granada, Granada, Spain
Venue:
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Year:
2012

Citing 9
Cited 0

A connectionist machine for genetic hillclimbing

A connectionist machine for genetic hillclimbing
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Montecito: A Dual-Core, Dual-Thread Itanium Processor

IEEE Micro
Peer-to-peer evolutionary algorithms with adaptive autonomous selection

Proceedings of the 9th annual conference on Genetic and evolutionary computation
EvAg: a scalable peer-to-peer evolutionary algorithm

Genetic Programming and Evolvable Machines
Gossiping Differential Evolution: A Decentralized Heuristic for Function Optimization in P2P Networks

ICPADS '10 Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems
A novel multi-population cultural algorithm adopting knowledge migration

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Recent progress in natural computation and knowledge discovery
A peer-to-peer approach to genetic programming

EuroGP'11 Proceedings of the 14th European conference on Genetic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a simple experiment for validating a Peer-to-Peer Evolutionary Algorithm in a real computing infrastructure in order to verify that results meet those obtained by simulations. The validation method consists of conducting a well-characterized experiment in a large computer cluster of up to a number of processors equal to the population estimated by the simulator. We argue that the validation stage is usually missing in the design of large-scale distributed meta-heuristics given the difficulty of harnessing a large number of computing resources. That way, most of the approaches in the literature focus on studying the model viability throughout a simulation-driven experimentation. However, simulations assume idealistic conditions that can influence the algorithmic performance and bias results when conducted in a real platform. Therefore, we aim at validating simulations by running a real version of the algorithm. Results show that the algorithmic performance is rather accurate to the predicted one whilst times-to-solutions can be drastically decreased when compared to the estimation of a sequential run.