Parallel Genetic Algorithm Using Algorithmic Skeleton

Authors

  • H. Deldari
  • T. Ghafarian
Abstract:

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons possible in order to select the best one for the application. The performance of the selected skeleton can be increased by specifying the virtual topology required by the appliation.This is a novel approach with no precedent. Nesting of skeletons used hereis another novelty of the study which has been employed only in few previous studies.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

full text

Software Design Pattern Using : Algorithmic Skeleton Approach

In software engineering, a design pattern is a general reusable solution to a commonly occurring problem in software design. A design pattern is not a finished design that can be transformed directly into code. It is a description or template for how to solve a problem that can be used in many different situations. Object-oriented design patterns typically show relationships and interactions be...

full text

Parallel Programming Using Skeleton Functions

Prograxnming parallel machines is notoriously difficult. Factors contributing to this difficulty include the complexity of concurrency, the effect of resource allocation on performance and the current diversity of parallel machine models. The net result is that effective portability, which depends crucially on the predictability of performance, has been lost. Functional programming languages ha...

full text

Multiprocessor Scheduling Using Parallel Genetic Algorithm

Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA) has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performanc...

full text

A Parallel Multigrid Skeleton Using BSP

Skeletons ooer the opportunity to improve parallel software development by providing a template-based approach to program design. However , due to the large number of architectural models available and the lack of adequate performance prediction models, such templates have to be opti-mised for each architecture separately. This paper proposes a programming environment based on the Bulk Synchron...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 22  issue 2

pages  1- 19

publication date 2004-01

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023