Pregled bibliografske jedinice broj: 88839
Parallelization of Elimination Tournament Selection without Synchronization
Parallelization of Elimination Tournament Selection without Synchronization // Proceedings of the 5th IEEE International Conference on Intelligent Engineering Systems INES 2001 / Patkai, Bela ; Rudas, Imre J. (ur.).
Tampere: Institute of Production Engineering, Tampere University of Tech., 2001. str. 85-89 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 88839 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Parallelization of Elimination Tournament Selection without Synchronization
Autori
Golub, Marin ; Jakobović, Domagoj ; Leo, Budin
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
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., 2001, 85-89
Skup
5th IEEE International Conference on Intelligent Engineering Systems INES 2001
Mjesto i datum
Helsinki, Finska, 16.09.2001. - 18.09.2001
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
tournament selection; parallel genetic algorithm; selection probability
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
