An architecture for massive parallelization of the compact genetic algorithm
Fernando G. Lobo, Claudio F. Lima, Hugo Martires
Abstract
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.
Create a lesson
Related papers
Position Paper: Neurotransmitters as a Missing Dimension in Artificial Neural Networks
Yupei Li, Manuel Milling, Berrak Sisman et al.
A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits
Umut Çalıkyılmaz, Nitin Nayak, Sven Groppe
Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization
Lu Han, Jin Wang, Yuchen Li et al.
A Spatiotemporal Extension of the Neuromorphic DBSCAN Implementation
Charles P. Rizzo, James S. Plank
Machine Zygote: Causal Biparental Heredity Before Learning in a Germline--Soma Artificial Agent
Lyes Saad Saoud
Bio-Inspired Palette Evolution in Indirectly Encoded Substrates: Timescale Compatibility Shapes Activation Function Discovery
Romain Claret, Michael O'Neill, Paul Cotofrei et al.