Article (Scientific journals)
Designing Robust Volunteer-based Evolutionary Algorithms
Jimenez Laredo, Juan Luis; Bouvry, Pascal; Lombraña Gonzalez, Daniel et al.
2014In Genetic Programming and Evolvable Machines
Peer reviewed
 

Files


Full Text
vec_gpem13.pdf
Author preprint (587.93 kB)
Download

The original publication is available at http://link.springer.com/article/10.1007%2Fs10710-014-9213-5


All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Evolutionary computation; Distributed algorithms; Fault tolerance; Genetic programming; Genetic algorithms; Volunteer computing; Peer-to-Peer; Desktop Grid
Abstract :
[en] This paper tackles the design of scalable and fault-tolerant evolutionary algorithms computed on volunteer platforms. These platforms aggregate computational resources from contributors all around the world. Given that resources may join the system only for a limited period of time, the challenge of a volunteer-based evolutionary algorithm is to take advantage of a large amount of computational power that in turn is volatile. The paper analyzes first the speed of convergence of massively parallel evolutionary algorithms. Then, it provides some guidance about how to design efficient policies to overcome the algorithmic loss of quality when the system undergoes high rates of transient failures, i.e. computers fail only for a limited period of time and then become available again. In order to provide empirical evidence, experiments were conducted for two well-known problems which require large population sizes to be solved, the first based on a genetic algorithm and the second on genetic programming. Results show that, in general, evolutionary algorithms undergo a graceful degradation under the stress of losing computing nodes. Additionally, new available nodes can also contribute to improving the search process. Despite losing up to 90% of the initial computing resources, volunteer-based evolutionary algorithms can find the same solutions in a failure-prone as in a failure-free run.
Disciplines :
Computer science
Author, co-author :
Jimenez Laredo, Juan Luis ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Bouvry, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Lombraña Gonzalez, Daniel;  Citizen Cyberscience Centre
Fernández de Vega, Francisco;  University of Extremadura
García Arenas, Maribel;  Universidad de Granada (España) = University of Granada (Spain) - UGR
Merelo Guervós, Juan Julián;  Universidad de Granada (España) = University of Granada (Spain) - UGR
Fernandes, Carlos M.;  University of Lisbon > Laseeb
Language :
English
Title :
Designing Robust Volunteer-based Evolutionary Algorithms
Publication date :
01 January 2014
Journal title :
Genetic Programming and Evolvable Machines
ISSN :
1389-2576
Publisher :
Springer New York LLC
Peer reviewed :
Peer reviewed
Name of the research project :
Green@Cloud project (INTER/CNRS/11/03)
Funders :
FNR - Fonds National de la Recherche [LU]
Available on ORBilu :
since 28 February 2014

Statistics


Number of views
120 (5 by Unilu)
Number of downloads
404 (0 by Unilu)

Scopus citations®
 
19
Scopus citations®
without self-citations
10
OpenCitations
 
17
WoS citations
 
15

Bibliography


Similar publications



Contact ORBilu