Reference : Designing Robust Volunteer-based Evolutionary Algorithms
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/15798
Designing Robust Volunteer-based Evolutionary Algorithms
English
Jimenez Laredo, Juan Luis mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Bouvry, Pascal mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Lombraña Gonzalez, Daniel mailto [Citizen Cyberscience Centre]
Fernández de Vega, Francisco mailto [University of Extremadura]
García Arenas, Maribel mailto [Universidad de Granada (España) = University of Granada (Spain) - UGR]
Merelo Guervós, Juan Julián mailto [Universidad de Granada (España) = University of Granada (Spain) - UGR]
Fernandes, Carlos M. mailto [University of Lisbon > Laseeb]
1-Jan-2014
Genetic Programming and Evolvable Machines
Springer New York LLC
Yes (verified by ORBilu)
International
1389-2576
[en] Evolutionary computation ; Distributed algorithms ; Fault tolerance ; Genetic programming ; Genetic algorithms ; Volunteer computing ; Peer-to-Peer ; Desktop Grid
[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.
Fonds National de la Recherche - FnR
http://hdl.handle.net/10993/15798
10.1007/s10710-014-9213-5
http://geneura.wordpress.com/?p=1420
The original publication is available at http://link.springer.com/article/10.1007%2Fs10710-014-9213-5

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
vec_gpem13.pdfAuthor preprint574.15 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.