International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) (2002)
Sept. 22, 2002 to Sept. 25, 2002
Gavril Godza , University Politehnica of Bucharest
Valentin Cristea , University Politehnica of Bucharest
The class of MIMD parallel computers includes multiprocessor architectures, such as UMA, COMA, and NUMA, as well as multicomputer architectures, such as MPP and COW. Despite huge technological differences, machines with different architectures may be used to run certain similar applications. An interesting category of applications that may be successfully executed on a variety of parallel architectures is that of Genetic Algorithms (GAs) that provide more and more attractive solution of many complex engineering problems for which classical optimization methods cannot be used. GAs prove to be parallelizable in a natural way. Parallel Genetic Algorithms (PGAs) highlight good balance between calculations and communications that allows obtaining good results on different classes of parallel architectures. The paper describes the results obtained in a comparative study of PGAs, implemented on a cluster of SunBlade 100 workstations (COW) and on a Sun Enterprise E10000 (UMA) computer. The study demonstrates suitability of these different architectures for the development and execution of this class of applications. Also, some relevant facts concerning the performance of PGAs are presented.
evolutionary computing, genetic algorithms, parallel computers, distributed algorithms, message passing
G. Godza and V. Cristea, "Comparative Study of COW and SMP Computer Configurations," International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)(PARELEC), Warsaw, Poland, 2002, pp. 205.