Comparison between Three Heuristic Algorithms to Repair a Large-Scale MIMD Computer

Authors:
Philippe Millet;Jean-Claude Heudin
Affiliations:
-;-
Venue:
ICES '00 Proceedings of the Third International Conference on Evolvable Systems: From Biology to Hardware
Year:
2000

Citing 3
Cited 0

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Fault Tolerance of a Large-Scale MIMD Architecture Using a Genetic Algorithm

ICES '98 Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware
Evolutionary Computation and the Tinkerer's Evolving Toolbox

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study tries to find a new task mapping using available resources of a partially broken MIMD machine based on an isochronous crossbar network. In this framework, we compare a genetic algorithm, a genetic programming algorithm and a simulated annealing algorithm. We show evidences that both genetic algorithms seem to be excellent to solve the problem.