Multi-GPU island-based genetic algorithm for solving the knapsack problem

Jiri Jaros*

*Corresponding author for this work

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

    27 Citations (Scopus)

    Abstract

    This paper introduces a novel implementation of the genetic algorithm exploiting a multi-GPU cluster. The proposed implementation employs an island-based genetic algorithm where every GPU evolves a single island. The individuals are processed by CUDA warps, which enables the solution of large knapsack instances and eliminates undesirable thread divergence. The MPI interface is used to exchange genetic material among isolated islands and collect statistical data. The characteristics of the proposed GAs are investigated on a two-node cluster composed of 14 Fermi GPUs and 4 six-core Intel Xeon processors. The overall GPU performance of the proposed GA reaches 5.67 TFLOPS.

    Original languageEnglish
    Title of host publication2012 IEEE Congress on Evolutionary Computation, CEC 2012
    DOIs
    Publication statusPublished - 2012
    Event2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, Australia
    Duration: 10 Jun 201215 Jun 2012

    Publication series

    Name2012 IEEE Congress on Evolutionary Computation, CEC 2012

    Conference

    Conference2012 IEEE Congress on Evolutionary Computation, CEC 2012
    Country/TerritoryAustralia
    CityBrisbane, QLD
    Period10/06/1215/06/12

    Fingerprint

    Dive into the research topics of 'Multi-GPU island-based genetic algorithm for solving the knapsack problem'. Together they form a unique fingerprint.

    Cite this