Improving volunteer computing scheduling for evolutionary algorithms

Malek Smaoui, Marc Garbey

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Evolutionary Algorithms (EA) have been extensively used in research to resolve optimization problems involving computationally intensive objective function evaluations. It is even more interesting to use a low-cost distributed computing platform based on Volunteer Computing (VC), to perform such optimizations. The downside is that VC compute nodes' volatility and unreliability associated with the level of task dependency introduced by parallel EA's tend to delay the algorithm's progress. This work proposes an enhanced scheduling of the BOINC (Berkeley Open Infrastructure for Network Computing) tasks associated with a Genetic Algorithm (GA) that aims at improving the performance of the algorithm. BOINC is the most popular middleware used for VC. While the GA has been chosen as it is the most commonly used EA, this approach is applicable to most of iterative EA's. The scheduling performs a matchmaking between a pool of tasks, classified according to their potential (predicted) fitness, and the pool of available hosts, classified according to their reliability. The scheduling technique have been implemented in a simulation environment and tested with benchmark functions. It proved to be effective in increasing the convergence speed and reducing the execution time of the GA.

Original languageEnglish (US)
Pages (from-to)1-14
Number of pages14
JournalFuture Generation Computer Systems
Volume29
Issue number1
DOIs
StatePublished - Jan 1 2013

Keywords

  • Boinc
  • Evolutionary algorithms
  • Genetic algorithm
  • Matchmaking
  • Scheduling
  • Virtual prairie
  • Volunteer computing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Improving volunteer computing scheduling for evolutionary algorithms'. Together they form a unique fingerprint.

Cite this