Software reliability via run-time result-checking
Journal of the ACM (JACM)
Sabotage-tolerance mechanisms for volunteer computing systems
Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
Algorithm-Based Diskless Checkpointing for Fault-Tolerant Matrix Operations
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Proceedings of the 2nd conference on Computing frontiers
A Fault Tolerant Optimization Algorithm based on Evolutionary Computation
DEPCOS-RELCOMEX '06 Proceedings of the International Conference on Dependability of Computer Systems
Grid computing for parallel bioinspired algorithms
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Is the island model fault tolerant?
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Algorithm-Based Fault Tolerance for Matrix Operations
IEEE Transactions on Computers
Towards Fault-Tolerant Systems based on Adaptive Cellular Genetic Algorithms
AHS '08 Proceedings of the 2008 NASA/ESA Conference on Adaptive Hardware and Systems
Automated design of image operators that detect interest points
Evolutionary Computation
Characterizing fault tolerance in genetic programming
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
The Handbook of Computer Networks
The Handbook of Computer Networks
Characterizing fault tolerance in genetic programming
Future Generation Computer Systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Proceedings of the 8th International Conference on Frontiers of Information Technology
On the Resilience of [Distributed] EAs against Cheaters in Global Computing Platforms
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
| Hi-index | 0.09 |
This paper analyzes the fault-tolerance nature of Evolutionary Algorithms (EAs) when executed in a distributed environment subjected to malicious acts. More precisely, the inherent resilience of EAs against two types of failures is considered: (1) crash faults, typically due to resource volatility which lead to data loss and part of the computation loss; (2) cheating faults, a far more complex kind of fault that can be modeled as the alteration of output values produced by some or all tasks of the program being executed. This last type of failure is due to the presence of cheaters on the computing platform. Most often in Global Computing (GC) systems such as BOINC, cheaters are attracted by the various incentives provided to stimulate the volunteers to share their computing resources: cheaters typically seek to obtain rewards with little or no contribution to the system. In this paper, the Algorithm-Based Fault Tolerance (ABFT) aspects of EAs against the above types of faults is characterized. Whereas the inherent resilience of EAs has been previously observed in the literature, for the first time, a formal analysis of the impact of the considered faults over the executed EA including a proof of convergence is proposed in this article. By the variety of problems addressed by EAs, this study will hopefully promote their usage in the future developments around distributed computing platform such as Desktop Grids and Volunteer Computing Systems or Cloud systems where the resources cannot be fully trusted.