Parallel genetic algorithm implementation for BOINC

Malek Smaoui, Viet Huy Nguyen, Marc Garbey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper we present our implementation of a Genetic Algorithm on the BOINC volunteer computing platform. Our main objective is to construct a computational framework that applies to the optimum design problem of prairies. This ecology problem is characterized by a large parameter set, noisy multi-objective functions, and the presence of multiple local optima that reflects biodiversity. Our approach consists in enhancing the iterative (synchronous) master-worker genetic algorithm to overcome the limitations of volatile and unreliable distributed computing resources considering a sufficiently large number of volunteer computers. Though volunteer computing is known to be much less performing than parallel environments such as clusters and grids, our GA solution turns to exhibit competitive performance.

Original languageEnglish (US)
Title of host publicationParallel Computing
Subtitle of host publicationFrom Multicores and GPU's to Petascale
PublisherIOS Press BV
Pages212-219
Number of pages8
ISBN (Print)9781607505297
DOIs
StatePublished - Jan 1 2010

Publication series

NameAdvances in Parallel Computing
Volume19
ISSN (Print)0927-5452

Keywords

  • Clonal plants
  • Ecology
  • Genetic Algorithms
  • Prairie Optimization
  • Volunteer Computing

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel genetic algorithm implementation for BOINC'. Together they form a unique fingerprint.

Cite this