Fault tolerance in distributed genetic algorithms with tree topologies

Authors:
Yiyuan Gong;Alex S. Fukunaga
Affiliations:
College of Mathematics and Computer Sciences, Fuzhou University, Fuzhou, Fujian, China;Global Edge Institute, Tokyo Institute of Technology, Meguro, Tokyo, Japan
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 7
Cited 0

Co-evolving parasites improve simulated evolution as an optimization procedure

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fault-tolerant routing in peer-to-peer systems

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms

Journal of Heuristics
Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces

Proceedings of the 6th International Conference on Genetic Algorithms
Statistical analysis of heuristics for evolving sorting networks

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the effects of communication failures in grid-based, distributed genetic algorithms with various topologies. We evaluated the performance behavior of distributed GAs under varying levels of persistent communication failures, using the sorting network problem as a benchmark application. In this experiment, we find that distributed GA with larger population size is less affected by the lower communication failure rate. However, the effect of lower communication failure on the performance of distributed GA varies with the topologies when population size is small. For all the tree topologies we investigated, when communications failures occur extremely frequently, then a significant performance degradation is observed. However, even in these extreme cases, we show that simple retry/reroute protocols for recovering from communication failure are sufficient to recover most of the performance.