Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111917" target="_blank" >RIV/00216305:26230/14:PU111917 - isvavai.cz</a>

Result on the web

<a href="http://www.fit.vutbr.cz/research/pubs/all.php?id=10480" target="_blank" >http://www.fit.vutbr.cz/research/pubs/all.php?id=10480</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Solving Multidimensional Knapsack Problem using CUDA Accelerated PSO

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2014

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

2014 IEEE Congress on Evolutionary Computation

ISBN

978-1-4799-1488-3

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

2933-2939

Publisher name

IEEE Computational Intelligence Society

Place of publication

Beijing

Event location

Beijing

Event date

Jul 6, 2014

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000356684604027