An architecture for massive parallelization of the compact genetic algorithm
神经与进化计算
2007-05-23 v1
摘要
This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The resulting scheme has three major advantages. First, it has low synchronization costs. Second, it is fault tolerant, and third, it is scalable. The paper argues that the benefits that can be obtained with the proposed approach is potentially higher than those obtained with traditional parallel genetic algorithms. In addition, the ideas suggested in the paper may also be relevant towards parallelizing more complex probabilistic model building genetic algorithms.
引用
@article{arxiv.cs/0402049,
title = {An architecture for massive parallelization of the compact genetic algorithm},
author = {Fernando G. Lobo and Claudio F. Lima and Hugo Martires},
journal= {arXiv preprint arXiv:cs/0402049},
year = {2007}
}
备注
12 pages, submitted to gecco 2004