A parallel skeleton for genetic algorithms

Authors:
Alberto de la Encina;Mercedes Hidalgo-Herrero;Pablo Rabanal;Fernando Rubio
Affiliations:
Dpto. Sistemas Informáticos y Computación, Facultad Informática, Universidad Complutense de Madrid, Spain;Dpto. Didáctica de las Matemáticas, Facultad Educación, Universidad Complutense de Madrid, Spain;Dpto. Sistemas Informáticos y Computación, Facultad Informática, Universidad Complutense de Madrid, Spain;Dpto. Sistemas Informáticos y Computación, Facultad Informática, Universidad Complutense de Madrid, Spain
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Year:
2011

Citing 13
Cited 0

GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Implementation Skeletons in Eden: Low-Effort Parallel Programming

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Parallelism abstractions in eden

Patterns and skeletons for parallel and distributed computing
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Algorithm + strategy = parallelism

Journal of Functional Programming
Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming

Parallel Computing
A parallel SML compiler based on algorithmic skeletons

Journal of Functional Programming
Analyzing the influence of mixed evaluation on the performance of Eden skeletons

Parallel Computing - Algorithmic skeletons
Evolutionary computation: a unified approach

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Runtime support for multicore Haskell

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Nature-Inspired Algorithms for Optimisation

Nature-Inspired Algorithms for Optimisation
Regular, shape-polymorphic, parallel arrays in Haskell

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nowadays, most users own multicore computers, but it is not simple to take advantage of them to speedup the execution of programs. In particular, it is not easy to provide a parallel implementation of a concrete genetic algorithm. In this paper we introduce a parallel skeleton that given a sequential implementation automatically provides a corresponding parallel implementation of it. In order to do it, we use a parallel functional language where skeletons can be defined as higherorder functions. Thus, the parallelizing machinery is defined only once, and it is reused for any concrete application of the skeleton to a concrete problem.