Publication Details

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

POSPÍCHAL, P.; SCHWARZ, J.; JAROŠ, J. Parallel Genetic Algorithm Solving 0/1 Knapsack Problem Running on the GPU. In 16th International Conference on Soft Computing MENDEL 2010. Brno: Brno University of Technology, 2010. p. 64-70. ISBN: 978-80-214-4120-0.
Czech title
Paralelní genetický algoritmus řešící 0/1 Knapsack problém běžící na GPU
Type
conference paper
Language
English
Authors
Pospíchal Petr, Ing.
Schwarz Josef, doc. Ing., CSc. (CM-SFE)
Jaroš Jiří, doc. Ing., Ph.D. (DCSY)
Keywords

massively parallel, genetic algorithm, island model, CUDA, GPU, 0/1 Knapsack problem

Abstract

In this work, we show that consumer-level $100 GPU can be used to significantly speed-up optimization of 0/1 Knapsack problem. We identify strong and weak points of GPU architecture and propose our parallel genetic algorithm model implemented in CUDA running entirely on the GPU. We show that GPU must be utilized for sufficiently long time in order to obtain reasonable program speedup. Then we compare results quality and speed of our model with single-threaded CPU code implemented using Galib. Peak speedup of GPU GA execution performance is 1340x resp. 134x for 4-bit resp. 40-bit problem instances while maintaining reasonable results quality.

Published
2010
Pages
64–70
Proceedings
16th International Conference on Soft Computing MENDEL 2010
ISBN
978-80-214-4120-0
Publisher
Brno University of Technology
Place
Brno
UT WoS
000288144100010
EID Scopus
2-s2.0-79955114415
BibTeX 
@inproceedings{BUT34660,
  author="Petr {Pospíchal} and Josef {Schwarz} and Jiří {Jaroš}",
  title="Parallel Genetic Algorithm Solving 0/1 Knapsack Problem Running on the GPU",
  booktitle="16th International Conference on Soft Computing MENDEL 2010",
  year="2010",
  pages="64--70",
  publisher="Brno University of Technology",
  address="Brno",
  isbn="978-80-214-4120-0",
  url="https://www.fit.vut.cz/research/publication/9253/"
}
Back to top