1. An improvement of dynamic programming to solve knapsack problem using multi-core system.
- Author
-
Mohammed, Zaidy Y. and Al-Neama, Mohammed W.
- Subjects
DYNAMIC programming ,KNAPSACK problems ,PROBLEM solving ,LINEAR orderings ,BACKPACKS ,ALGORITHMS - Abstract
The 0/1 Knapsack Problem (KP) is one of the problems in optimization where a set of items with given benefit and weights.The aim is to select a subset of the items in order to maximize the total benefit without exceeding the knapsack capacity. Nowadays, it becomes a big dilemma due to the explosion in the amount of datasets. In this paper, P(KD)P algorithm has been proposed and performed. For effectively calculating the KM matrix using multi- core system, an improved approach of the DP_KP algorithm has been considered. The proposed scheduling and partitioning approaches have accomplished a significant enhancement to the overall performance. Executions were implemented on corei7 with (8 cores). It outperforms sequential KP_DP more than 16-fold speedup and (KD)P more than 5-fold speedup. Its efficiency reaches 0.316, 0.0829 and 0.0979 over the KP_DP, (KD)P, and P(KD)P respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF