The differences of parallel efficiency between the two models of parallel genetic algorithms on PC cluster systems

Author

Hiroyasu, Tomoyuki ; Miki, Mitsunori ; Tanimura, Yusuke

Author_Institution

Dep. of Knowledge Eng. & Comput. Sci., Kyoto, Japan

Volume

2

fYear

2000

fDate

14-17 May 2000

Firstpage

945

Abstract

In this paper, the characteristics of the typical two models of parallel genetic algorithms are compared. Those models are the coarse grained model and the micro grained model. Especially, the parallel efficiency and the total calculation time on PC clusters that are built with commodity hardware are examined. The characteristics are examined through the numerical examples. There are two major characteristics in the coarse grained model. One of them as the network cost is very small. The other is the fact that the necessary number of iteration is smaller than that of the model of the micro grained model. On the other hand, in the micro grained model, the ideal parallel efficiency cannot be reached to 100%. Therefore, it is concluded that the coarse grained model is suitable for PC cluster systems.

Keywords

genetic algorithms; parallel algorithms; workstation clusters; PC cluster systems; coarse grained model; commodity hardware; micro grained model; network cost; parallel efficiency; parallel genetic algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on

Conference_Location

Beijing, China

Print_ISBN

0-7695-0589-2

Type

conf

DOI

10.1109/HPC.2000.843576

Filename

843576