Parallel Genetic Algorithm Solving 0/1 Knapsack Problem Running on the GPU

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU89561" target="_blank" >RIV/00216305:26230/10:PU89561 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Parallel Genetic Algorithm Solving 0/1 Knapsack Problem Running on the GPU
Original language description
<div>In this work, we show that consumer-level $100 GPU can be used to significantly speed-up optimization</div> <div>of 0/1 Knapsack problem. We identify strong and weak points of GPU architecture and propose our parallel</div> <div>genetic algorithm model implemented in CUDA running entirely on the GPU. We show that GPU must be utilized</div> <div>for sufficiently long time in order to obtain reasonable program speedup. Then we compare results quality and</div> <div>speed of our model with single-threaded CPU code implemented using Galib. Peak speedup of GPU GA execution</div> <div>performance is 1340x resp. 134x for 4-bit resp. 40-bit problem instances while maintaining reasonable results</div> <div>quality.</div>
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
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2010
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
16th International Conference on Soft Computing MENDEL 2010
ISBN
978-80-214-4120-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
—
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Brno
Event date
Jun 23, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)