PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Hidalgo J. I., Prieto M., Lanchares J., Baraglia R., Tirado F., Garnica O. Hybrid Parallelization of a Compact Genetic Algorithm. In: Euromicro Conference on Parallel, Distributed and Network-Based (Genova, Italy, 5-7 Februrary 2003). Proceedings, pp. 449 - 455. Andrea Clematis (ed.). IEEE Computer Society, 2003.
 
 
Abstract
(English)
Genetic Algorithms (GAs) are stochastic optimization heuristics in which searches in solution space are carried out by imitating the population genetics stated in Darwin's theory of evolution. We have focused this work on compact Genetic Algorithms (cGAs), which unlike standard GAs do not manage a population of solutions but only mimics its existence. In this paper we have studied several approaches that can be used to implement parallel cGAs in order to reduce the execution times and to improve the quality of the solutions reached by increasing population sizes. The parallelization models adopted to implement GAs can be classified as: centralized, global, fine grained and coarse grained. For a cGA only the two first models can be applied. Our approach consists in an hybrid model which combines both centralized and global implementations. The cGA incorporates a local search method and has been applied for solving a graph-partitioning problem for solving the Multi-FPGA systems partitioning and placement.
URL: http://csdl.computer.org/comp/proceedings/euro-pdp/2003/1875/00/18750449abs.htm
Subject Compact Genetic Algorithm
Graph-partitioning
Local search
Hybrid parallelization
D.1.3 Concurrent programming. Parallel programming


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional