Detail publikace
Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO
ZÁŇ, D. JAROŠ, J.
Originální název
Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
This paper addresses the possibility of solving the MKP using a GPU accelerated Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable performance benefit when using a highly optimised GPU code instead of an efficient multi-core CPU implementation while preserving the quality of the search process.
Klíčová slova
Particle Swarm Optimization, Multidimensional Knapsack Problem,
GPU, CUDA, Performance comparison.
Autoři
ZÁŇ, D.; JAROŠ, J.
Rok RIV
2014
Vydáno
5. 7. 2014
Nakladatel
IEEE Computational Intelligence Society
Místo
Beijing
ISBN
978-1-4799-1488-3
Kniha
Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Strany od
2933
Strany do
2939
Strany počet
7
URL
BibTex
@inproceedings{BUT111512,
author="Drahoslav {Záň} and Jiří {Jaroš}",
title="Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO",
booktitle="Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014",
year="2014",
pages="2933--2939",
publisher="IEEE Computational Intelligence Society",
address="Beijing",
doi="10.1109/CEC.2014.6900534",
isbn="978-1-4799-1488-3",
url="https://www.fit.vut.cz/research/publication/10480/"
}
Dokumenty