Abstract

In this paper we present a concurrent implementation of coevolutionary genetic algorith m (GA ) designed for shared memo ry architectures such as multi-core processor platforms. Our algorith m div ides the chromosome among the processes, and not the population as it is the case for most parallel imp lementations of the GA. This approach results in a division of the problem to be solved by the GA into sub-problems. We analyze the influence on performance and speedup of several parameters defining the algorith m, such as: a synchronous or asynchronous informat ion exchange between processes and the frequency of communication between processes. We also examine how the problem separability influ- ences the general algorith m performance. Finally, we co mpare different operating systems and platforms in the evaluation process. Our paper shows that this approach is a good way to take advantage of mu lti-core processers and improve not only the execution time, but also the fitness in many cases.

Highlights

  • The hardware develop ments fro m recent years have made mu lti-core arch itectures a common place in the industry

  • The model that we propose in this paper bridges the gap between these two approaches

  • The difference is that the current model is imp lemented for shared memo ry arch itectures as opposed to a Beowulf cluster, and the experiments use a different set of problems

Read more

Summary

Introduction

The hardware develop ments fro m recent years have made mu lti-core arch itectures a common place in the industry. Even though competitive coevolution is the more popular form, the cooperative form has been proven to give good results[2] These approaches decompose the problem into parts evolving separately[12]. Our model is based on a d ivision at the genotype level of the population into several agents or processes It is not an algorith mically equivalent version of the genetic algorith m, or of a standard cooperative coevolutionary algorith m, but a hybrid model designed for parallel a rchitectures. This model can potentially run faster and achieve better results than the standard GA.

Chromosome Division Model
Problem Di vision
Fi tness Evaluati on
Synchronous vs Asynchronous Exchange
Test Problems
Benchmark Problems
Real-Life Problem
Experimental Results
Synchronous versus Asynchronous Exchange
Infl uence of the Synchronizati on Peri od
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call