An Architecture for Massive Parallelization of the Compact Genetic Algorithm

This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The approach is scalable, has low synchronization costs, and is fault tolerant. The paper argues that the benefits that can be obtained with the proposed methodology is potentially higher than those obtained with traditional parallel genetic algorithms.

• Type: Conference
• Year: 2004
• Where: GECCO
• Authors: Fernando G. Lobo, Cláudio F. Lima, Hugo Martires
• Keywords: Compact Genetic Algorithm, GECCO 2004, Genetic Algorithms, Low Synchronization Costs