0-1 Knapsack problem parallelization using OpenMP and Nvidia CUDA

Trajanovski, Nikola and Zdraveski, Vladimir and Gushev, Marjan (2017) 0-1 Knapsack problem parallelization using OpenMP and Nvidia CUDA. In: PROCEEDINGS of the 14th Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 181-184. ISBN 978-608-4699-07-1

[img]
Preview
Text
978-608-4699-07-1_pp181-184.pdf

Download (138kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

The 0-1 knapsack problem is one of the most famous problems in computer science. The problem is defined for a set of items, each with predefined weight and value. A knapsack can carry a limited weight and the idea is to select items that will have a higher value. The problem is to determine the number of each particular item to include in a collection so that the total weight is less than or equal to the limit and the total value is as large as possible. We experiment with OpenMP parallel CPU solution and a CUDA GPU solution based on a simple brute force knapsack algorithm. This requires no additional input data transformation. The provided solutions demonstrate the high scalability and speedup in both the CPU and GPU implementations.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Students Session
Depositing User: Vangel Ajanovski
Date Deposited: 29 Nov 2017 18:28
Last Modified: 29 Nov 2017 18:28
URI: http://eprints.finki.ukim.mk/id/eprint/11400

Actions (login required)

View Item View Item