A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
A large-scale study of failures in high-performance computing systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Characterizing resource availability in enterprise desktop grids
Future Generation Computer Systems
Is the island model fault tolerant?
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Scalability problems of simple genetic algorithms
Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On the Run-Time Dynamics of a Peer-to-Peer Evolutionary Algorithm
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Automated design of image operators that detect interest points
Evolutionary Computation
Increasing GP Computing Power for Free via Desktop GRID Computing and Virtualization
PDP '09 Proceedings of the 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing
Characterizing fault tolerance in genetic programming
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Resilience to churn of a peer-to-peer evolutionary algorithm
International Journal of High Performance Systems Architecture
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
This paper presents a study of the fault-tolerant nature of Genetic Algorithms (GAs) on a real-world Desktop Grid System, without implementing any kind of fault-tolerance mechanism. The aim is to extend to parallel GAs previous works tackling fault-tolerance characterization in Genetic Programming. The results show that GAs are able to achieve a similar quality in results in comparison with a failure-free system in three of the six scenarios under study despite the system degradation. Additionally, we show that a small increase on the initial population size is a successful method to provide resilience to system failures in five of the scenarios. Such results suggest that Paralle GAs are inherently and naturally fault-tolerant.