engleski

An Asynchronous Model of Global Parallel Genetic Algorithms

Genetic algorithms usually require more computation power than other heuristic approaches do. In this paper we introduce an efficient implementation of asynchronously global parallel genetic algorithm with 3-tournament elimination selection. The parallelization of the algorithm is achieved through multithreading mechanism, a very effective and easy to implement technique. With parallelization we can get a significant decrease in computational time on a multiprocessor system. Reducing interprocess communication is a key to getting high performance in parallel computing. That is the reason why the asynchronous model is used. Described model of global PGA is suitable for implementation on a shared memory multiprocessor.

parallel genetic algorithm; multithreading; speed-up; tournament selection

nije evidentirano