On the Intrinsic Fault-Tolerance Nature of Parallel
Genetic Programming
15th Euromicro Conference on Parallel, Distributed and
Network-based Processing, page 450--458. Naples, IEEE, (7-9 February 2007)DOI: doi:/10.1109/PDP.2007.56
Abstract
In this paper we show how Parallel Genetic Programming
can run on a distributed system with volatile resources
without any lack of efficiency. By means of a series of
experiments, we test whether Parallel GP -and
consistently Evolutionary Algorithms- are intrinsically
fault-tolerant. The interest of this result is crucial
for researchers dealing with real-life problems in
which parallel and distributed systems are required for
obtaining results on a reasonable time. In that case,
parallel GP tools will not require the inclusion of
fault-tolerant computing techniques or libraries when
running on Meta-systems undergoing volatility, such us
Desktop Grids offering Public Resource Computing. We
test the performance of the algorithm by studying the
quality of solutions when running over distributed
resources undergoing processors failures, when compared
with a fault-free environment. This new feature, which
shows its advantages, improves the dependability of the
Parallel Genetic Programming Algorithm.
Links and resources
Tags
community
@brazovayeye's tags highlighted