An architecture for massive parallelization of the compact genetic algorithm

02/20/2004
by   Fernando G. Lobo, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2004

Parameter-less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search

This paper presents a parameter-less optimization framework that uses th...
research
11/23/2012

Genetic Algorithm Modeling with GPU Parallel Computing Technology

We present a multi-purpose genetic algorithm, designed and implemented w...
research
05/16/2019

Heterogeneous Parallel Genetic Algorithm Paradigm

The encoding representation of the genetic algorithm can boost or hinder...
research
12/04/2009

Search for overlapped communities by parallel genetic algorithms

In the last decade the broad scope of complex networks has led to a rapi...
research
03/18/2013

Generating extrema approximation of analytically incomputable functions through usage of parallel computer aided genetic algorithms

This paper presents capabilities of using genetic algorithms to find app...
research
01/03/2023

Improving Reflexive Surfaces Efficiency with Genetic Algorithms

We propose using a Genetic Algorithm to improve the efficiency of reflex...
research
06/12/2017

Interactive Shape Perturbation

We present a web application for the procedural generation of perturbati...

Please sign up or login with your details

Forgot password? Click here to reset