Parallelization of Elimination Tournament Selection without Synchronization (CROSBI ID 484821)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Golub, Marin ; Jakobović, Domagoj ; Leo, Budin
engleski
Parallelization of Elimination Tournament Selection without Synchronization
A global parallel genetic algorithm (GPGA) with elimination tournament selection without duplicates is described in this paper. The parallel implementation of genetic algorithm with multiple threads without synchronization is thoroughly investigated. The problem which occurs when several threads select the same individual for elimination is recognized in such implementation. The probability of that event is analytically formulated. Considering that probability, we determine the total number of iterations the asynchronous GPGA should perform in order to achieve the same optimization effect as a serial GA or a synchronous GPGA.
tournament selection; parallel genetic algorithm; selection probability
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
85-89-x.
2001.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the 5th IEEE International Conference on Intelligent Engineering Systems INES 2001
Patkai, Bela ; Rudas, Imre J.
Tampere: Institute of Production Engineering, Tampere University of Tech.
Podaci o skupu
5th IEEE International Conference on Intelligent Engineering Systems INES 2001
predavanje
16.09.2001-18.09.2001
Helsinki, Finska