Multi-GPU Island-Based Genetic Algorithm Solving the Knapsack Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101750" target="_blank" >RIV/00216305:26230/12:PU101750 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/CEC.2012.6256131" target="_blank" >http://dx.doi.org/10.1109/CEC.2012.6256131</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CEC.2012.6256131" target="_blank" >10.1109/CEC.2012.6256131</a>

Result language
angličtina
Original language name
Multi-GPU Island-Based Genetic Algorithm Solving the Knapsack Problem
Original language description
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 treated by CUDA warpsenabling to solve large knapsack instances and eliminate undesirable thread divergence. The OpenMPI interface is used to exchange genetic material among different islands and to collect statistical data. The implementation characteristics are investigated on a cluster composed of 14 GPUs and 4 six-core Intel Xeon processors.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP103%2F10%2F1517" target="_blank" >GAP103/10/1517: Natural Computing on Unconventional Platforms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2012 IEEE World Congress on Computational Intelligence
ISBN
978-1-4673-1508-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
217-224
Publisher name
Institute of Electrical and Electronics Engineers
Place of publication
CA
Event location
Brisbane
Event date
Jun 10, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)