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 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.
KeywordsCommunication Cost Probability Vector Genetic Algo Communication Step Parallel Genetic Algorithm
Unable to display preview. Download preview PDF.
- Cantú-Paz, E. (2000) Efficient and accurate parallel genetic algorithms. Kluwer Academic Publishers, Boston, MA.Google Scholar
- Harik, G.R. (1997) Personal communication.Google Scholar
- Deb, K., Goldberg, D.E. (1993) Analyzing deception in trap functions. In Whitley, L.D., ed.: Foundations of Genetic Algorithms 2, San Mateo, CA, Morgan Kaufmann, pp. 93–108Google Scholar
- Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M. (2001) SETI@home-massively distributed computing for SETI. Computing in Science and Engineering 3 pp. 79Google Scholar