On the Intrinsic Fault-Tolerance Nature of Parallel Genetic Programming

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

[1]  David E. Goldberg,et al.  Efficient Parallel Genetic Algorithms: Theory and Practice , 2000 .

[2]  15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy , 2007, PDP.

[3]  Leonardo Vanneschi,et al.  Parallel genetic programming , 2005 .

[4]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[5]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[6]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[7]  Miron Livny,et al.  Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System , 1997 .

[8]  William H. Sanders,et al.  A performability-oriented software rejuvenation framework for distributed applications , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[9]  Felix C. Gärtner,et al.  Fundamentals of fault-tolerant distributed computing in asynchronous environments , 1999, CSUR.

[10]  William B. Langdon,et al.  Java based Distributed Genetic Programming on the Internet , 1999, GECCO.

[11]  M. Tomassini,et al.  Saving computational effort in genetic programming by means of plagues , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[12]  M. Parizeau,et al.  A Robust Master-Slave Distribution Architecture for Evolutionary Computations , 2003 .

[13]  Marc Parizeau,et al.  Distributed Beagle: An Environment For Parallel And Distributed Evolutionary Computations , 2003 .

[14]  Erick Cantú-Paz,et al.  Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms , 1999, GECCO.

[15]  Marco Tomassini,et al.  Experimental study of isolated multipopulation genetic programming , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.

[16]  Douglas Thain,et al.  Building Reliable Clients and Services , 2004, The Grid 2, 2nd Edition.

[17]  William B. Langdon,et al.  Some Considerations on the Reason for Bloat , 2002, Genetic Programming and Evolvable Machines.

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[19]  A. Abbas,et al.  Object oriented parallel programming , 2002, IEEE Students Conference, ISCON '02. Proceedings..

[20]  Partha Dasgupta,et al.  CALYPSO: a novel software system for fault-tolerant parallel processing on distributed platforms , 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing.